52225

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=33A051896
• a(n) = a(n-1) + a(n-2) + a(n-3) + R(a(n-4)) where a(0)=a(1)=a(2)=a(3)=1 and R(n) (A004086) is the reverse of n.at n=18A074863
• Numbers n such that in binary representation n is a substring of the n-th prime.at n=18A091020
• Palindromes n such that n+(product of digits of n) gives a larger palindrome.at n=16A114341
• Palindromic primes in base 6 (written in base 6).at n=23A117701
• Zeroless numbers n such that n and n - (product of digits of n) are both palindromes.at n=33A229761
• Numbers k with nonzero digits such that k +/- the product of digits of k are both palindromes.at n=19A244547
• Palindromes n with nonzero digits such that n +/- the product of digits of n are both palindromes.at n=13A244548
• Index of the smallest prime where n consecutive trailing digits of the index written in binary match n consecutive trailing digits in the prime when written in binary.at n=14A245522
• Index of the smallest prime where n consecutive trailing digits of the index written in binary match n consecutive trailing digits in the prime when written in binary.at n=15A245522
• Palindromes of the form 4n + 1 that are divisible by 5.at n=23A256704
• a(n)^2 is the least possible value at the root of a binary tree of height n where all nodes hold positive squares and all interior nodes also equal the sum of their two children.at n=16A309167