33933

Appears in sequences

• Palindromes with exactly 2 palindromic prime factors (counted with multiplicity), and no other prime factors.at n=36A046376
• Palindromes with exactly 2 distinct palindromic prime factors.at n=32A046408
• Palindromes expressible as the sum of 3 consecutive palindromes.at n=27A046498
• Euler transform of Euler totient function phi(n), cf. A000010.at n=23A061255
• Palindromic integers > 0, whose 'Reverse and Add!' trajectory (presumably) does not lead to another palindrome.at n=17A070001
• a(n) is the odd-length palindrome whose digits up to the center are those of n and whose center digit is equal to the digital root of the product of the factorial of n and the reverse of n.at n=32A082941
• Integers that do not appear in A103502.at n=16A103504
• Near-repdigit semiprimes with 3 as repeated digit.at n=32A105984
• Palindromes for which the multiplicative digital root is a prime.at n=35A117059
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (0, 0, 1), (0, 1, -1), (1, -1, -1)}.at n=12A148024
• Matrix inverse of the triangle of Eulerian numbers T(n,k), 0<=k<=n, read by rows.at n=33A224228
• Numbers with digits 3 and 9 only.at n=34A284964
• Least number x such that x^n has n digits equal to k. Case k = 2.at n=20A285449
• Numbers k such that (77*10^k - 257)/9 is prime.at n=20A293277
• Number of n X 3 0..1 arrays with each 1 adjacent to 0, 1 or 3 king-move neighboring 1s.at n=6A296646
• Number of nX7 0..1 arrays with each 1 adjacent to 0, 1 or 3 king-move neighboring 1s.at n=2A296650
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 0, 1 or 3 king-move neighboring 1s.at n=38A296651
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 0, 1 or 3 king-move neighboring 1s.at n=42A296651
• Expansion of Product_{k>0} 1/(1 - k*(k+1)/2 * x^(k*(k+1)/2)).at n=25A319257
• a(n) = (10^(2*n+1)-1)/3 + 6*10^n.at n=2A332139