22822

Appears in sequences

• Number of n-move self-avoiding knight paths on 5 X 5 board, beginning at corner.at n=10A025589
• Numbers having four 2's in base 10.at n=29A043500
• Largest palindromic substring in 4^n.at n=50A046262
• Palindromes with exactly 2 palindromic prime factors (counted with multiplicity), and no other prime factors.at n=30A046376
• Palindromes with exactly 2 distinct palindromic prime factors.at n=26A046408
• Palindromic untouchable numbers.at n=31A048187
• Palindromic integers > 0, whose 'Reverse and Add!' trajectory (presumably) does not lead to another palindrome.at n=5A070001
• Palindromic even squarefree numbers with an even number of distinct prime factors.at n=22A075811
• Palindromic even numbers with exactly 2 prime factors (counted with multiplicity). Equivalently, palindromic numbers of the form 2*p with p prime.at n=16A075813
• a(n) = concatenate(n, A010888(2*n), reverse(n)), where A010888 = digital root.at n=21A082944
• Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n containing k subwords of the type U H^j U or D H^j D for some j>0, where U=(1,1), H=(1,0) and D=(1,-1) (can be easily expressed using RNA secondary structure terminology).at n=51A097100
• 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=48A100957
• Theorems from propositional calculus, translated into decimal digits.at n=37A101273
• Near-repdigit semiprimes with 2 as repeated digit.at n=21A105983
• a(n) = n^3 + (n+1)*(n+2).at n=28A270109
• Number of binary strings of length n avoiding 4-antipowers.at n=33A275061
• Numbers with digits 2 and 8 only.at n=34A284922
• a(n) = 2*(10^(2n+1)-1)/9 + 6*10^n.at n=2A332128
• Palindromes that can be written as the sum of two palindromic primes.at n=40A356824