255552

Appears in sequences

• Largest palindromic substring in 2^n.at n=41A046260
• Palindromes with exactly 10 prime factors (counted with multiplicity).at n=8A046336
• Composite palindromes divisible by the sum of their prime factors (counted with multiplicity).at n=15A046348
• Palindromes with exactly 10 palindromic prime factors (counted with multiplicity).at n=4A046384
• a(n) contains n digits (either '2' or '5') and is divisible by 2^n.at n=5A053317
• a(1) = 2, a(n+1) = smallest multiple of a(n) using only prime digits (2,3,5,7).at n=4A078232
• Palindromes n with the property that for some prime p, n = p + prime(p).at n=12A155214
• Number of 0..n arrays of length 5 with each element unequal to at least one neighbor, starting with 0.at n=21A221464
• Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 9 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=4*floor(n/2), read by rows.at n=47A238581
• a(n) = lcm(tau(n), pod(n)) where tau(k) = the number of divisors of k (A000005) and pod(n) = the product of divisors of k (A007955).at n=43A324528
• Least of the smoothest two-nonzero-digit numbers of length n.at n=4A370849