human
Sum of all N digit palindromic numbers divisible by 9 formed using digits 1 to 9 | Function for finding count of N digits palindrome which are divisible by 9.
If N is odd.
If N is even.
Function for finding sum of N digits palindrome which are divisible by 9.
Count the possible number of palindrome.
Driver Code"
Solution in Python:

=====
What is a code to sum of all N digit palindromic numbers divisible by 9 formed using digits 1 to 9 and the other steps required?
assistant
#Here is code to sum of all N digit palindromic numbers divisible by 9 formed using digits 1 to 9 and the other steps required.
 def countPalindrome ( n ) :
	count = 0
	if ( n % 2 == 1 ) :
		count = pow ( 9 , ( n - 1 ) // 2 )
	else :
		count = pow ( 9 , ( n - 2 ) // 2 )
	return count
def sumPalindrome ( n ) :
	count = countPalindrome ( n )
	res = 0
	if ( n == 1 ) :
		return 9
	if ( n == 2 ) :
		return 99
	for i in range ( n ) :
		res = res * 10 + count * 5
	return res
n = 3
print ( sumPalindrome ( n ) )