25152

Appears in sequences

• Number of protruded partitions of n with largest part at most 2.at n=18A005403
• Number of reversible strings with n-1 beads of 2 colors. 7 beads are black. String is not palindromic.at n=11A032094
• Palindromic and divisible by 8.at n=33A045643
• Palindromes with exactly 8 prime factors (counted with multiplicity).at n=1A046334
• Palindromes with exactly 8 prime factors (counted with multiplicity) each of which is a palindrome.at n=1A046382
• a(n) = Product_{i=2..n} A001222(i) * Sum_{i=2..n} 1/A001222(i).at n=15A067580
• n-th largest palindrome whose digit sum is n.at n=14A082265
• Palindromes k such that 3k + 1 is also a palindrome.at n=25A083829
• a(n) = T(n) concatenated with reverse(T(n)) divided by 11, where T(n) is the n-th triangular number.at n=23A084008
• Palindromes n such that n+(product of digits of n) gives a larger palindrome.at n=8A114341
• Palindromic numbers that contain the sum of their digits as a substring.at n=23A121939
• Biquadrateful (i.e., not biquadrate-free) palindromes.at n=14A133514
• a(n) = 2^n*A122705(n).at n=4A185182
• G.f. satisfies: A(x) = x+x^2 + x*A(A(x)).at n=7A213010
• Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 3Xn array.at n=9A219854
• Zeroless numbers n such that n and n - (product of digits of n) are both palindromes.at n=19A229761
• Numbers k with nonzero digits such that k +/- the product of digits of k are both palindromes.at n=9A244547
• Palindromes n with nonzero digits such that n +/- the product of digits of n are both palindromes.at n=6A244548
• Number of length 5+1 0..n arrays with the sum of the cubes of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=8A250232
• Numbers k such that the largest prime divisor of k^4+1 is less than k.at n=30A309562