19091

Appears in sequences

• E.g.f: exp(x/(1-2*x))/(1-2*x).at n=5A025167
• Palindromes of length greater than 1 in decimal expansion of Pi (not showing leading 0's).at n=45A068046
• Numbers n for which there are exactly ten k such that n = k + reverse(k).at n=12A072434
• Consider all (2n+1)-digit palindromic primes of the form 90...0M0...09 (so that M is a palindrome with <= 2n-1 digits); a(n) = smallest such M.at n=37A100957
• Palindromic cyclops numbers.at n=18A138131
• Number of n X n nonnegative integer arrays with every 2 X 2 subblock summing to 4.at n=4A145014
• Members of A038512 of the form k, k+2, k+6, k+8.at n=24A155511
• Numbers n such that 4n+3 is a palindromic prime.at n=43A193419
• Number of partitions p of n such that (number of even numbers in p) >= (number of odd numbers in p).at n=40A241639
• Numbers n such that n +/- the product of digits of n are both palindromes.at n=45A244541
• Palindromes n such that n +/- the product of digits of n are both palindromes.at n=42A244542
• p(1,n), where the polynomial p(n,x) is defined in Comments; sum of the numbers in row n of the triangular array at A249130.at n=9A249131
• Palindromes with no palindromic aliquot parts except 1.at n=24A257973
• Numbers n such that the sum of the prime factors (including repeats) of prime(n)-1 and prime(n+1)-1 are the same.at n=16A259564
• Number of set partitions of [n] with alternating parity of elements and exactly five blocks.at n=8A305779
• Number of nontrivial equivalence classes of S_n under the {1234,3412} pattern-replacement equivalence.at n=43A330395
• First quadrisection of A332843.at n=16A330522
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = Sum_{j=0..n} k^j * j! * binomial(n,j)^2.at n=33A341014