43434

Appears in sequences

• Palindromic Super-3 Numbers.at n=6A032751
• a(n) = n*(14*n^2 - 21*n + 13)/6.at n=27A071229
• Partition the nonnegative integers into minimal groups whose sums are palindromes; this sequence gives the sums.at n=27A072482
• Roman numerals for n evaluated as if in base 36.at n=11A073421
• Triangle, read by rows, where T(n,k) equals the sum of squares of numbers < 2^n having exactly k ones in their binary expansion.at n=22A110200
• a(n) = sum of squares of numbers < 2^n having exactly 2 ones in their binary representation.at n=6A110202
• a(n+1) = least palindrome not already used that is either a divisor or multiple of a(n) such that the ratios a(n+1)/a(n) are all distinct.at n=35A111678
• Palindromes with consecutive digits that differ exactly by 1.at n=38A207954
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 173", based on the 5-celled von Neumann neighborhood.at n=39A270467
• Numbers n such that n * x/(x-1) produces a rotation of the digits in n for some value of x.at n=30A288669
• Palindromes that can be written in more than one way as the sum of two distinct palindromic primes.at n=32A356854
• Palindromes that can be written in more than one way as the sum of two palindromic primes.at n=35A356881