52925

Appears in sequences

• a(n) = smallest palindrome > a(n-1) such that a(1)*a(2)*...*a(n) + 1 is prime with a(1) = 2.at n=34A051896
• n-th largest palindrome whose digit sum is n.at n=22A082265
• Palindromes of the form 4n + 1 where n is also a palindrome. Palindromes arising in A083831.at n=12A083832
• Smallest palindromic multiple of n in which the digit string of n appears as sandwiched between at least a pair of digits, or 0 if n = 10k or no such number exists.at n=28A084043
• Smallest palindromic multiple of n in which n is a substring (anywhere), or 0 if n = 10k or no such number exists.at n=28A084044
• Triangle read by rows: T(n,k) = (1/k) times the number of functions from an n-element set into but not onto a k-element set.at n=32A101031
• a(n) is the number of integers k less than 10^n such that the decimal representation of k lacks the digits 1,2,3,4 and 5 and at least one of digits 6,7,8,9.at n=6A126642
• Triangle T(n, k) = Sum_{j=0..k-1} (-1)^j*binomial(k, j+1)*(k-j)^(n-k), read by rows.at n=58A158198
• Zeroless numbers n such that n and n - (product of digits of n) are both palindromes.at n=40A229761
• Integers that are Rhonda numbers to base 30.at n=25A255736
• Palindromes of the form 4n + 1 that are divisible by 5.at n=30A256704