25652

Appears in sequences

• Even palindromes in which parity of digits alternates.at n=38A030149
• Number of polyhexes of class PF2 with C_{2n} symmetry.at n=8A030520
• Numbers that are palindromic, divisible by 11 and have an odd number of digits.at n=22A045571
• Palindromic even lucky numbers.at n=34A045960
• Palindromes with exactly 5 prime factors (counted with multiplicity).at n=34A046331
• Palindromic untouchable numbers.at n=41A048187
• Numbers n for which there are exactly twelve k such that n = k + reverse(k).at n=19A072435
• Smallest number a(n)>a(n-1) such that T(a(n-1))+T(a(n))=T(m) for some m, a(1)=3; T(i) are the triangular numbers.at n=32A072522
• n-th largest palindrome whose digit sum is n.at n=19A082265
• 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=47A111678
• Palindromes which are sums of two consecutive primes.at n=18A162571
• Numbers n such that d(1)^1 + d(2)^2 + ... + d(p)^p and d(1)^p + d(2)^p-1 +... + d(p)^1 are squares, where d(i), i=1..p, are the digits of n.at n=46A178360
• Triangle read by rows: T(n,k) = number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to k.at n=56A180281
• Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 2.at n=9A180282
• Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-9.at n=1A180299
• Zeroless numbers n such that n and n - (product of digits of n) are both palindromes.at n=24A229761
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with the (lower) medians of each row unequal to its neighbors and each column equal to its neighbors.at n=21A238026
• Number of (1+2) X (n+2) 0..1 arrays with the (lower) medians of each row unequal to its neighbors and each column equal to its neighbors.at n=6A238027
• Number of nX4 0..1 arrays with every element equal to 0, 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=8A300092
• Triangle read by rows: T(n,k) is the number of unoriented series-parallel networks with n colored elements using exactly k colors.at n=20A339282