24942

Appears in sequences

• Fibonacci sequence beginning 1, 15.at n=17A022105
• Numerators of continued fraction convergents to sqrt(214).at n=9A041398
• Palindromic untouchable numbers.at n=38A048187
• a(n) = Sum_{k=1..n} T(n,k), array T as in A049790.at n=41A049791
• Numbers which are the sum of their proper divisors containing the digit 4.at n=35A059463
• Palindromic integers > 0, whose 'Reverse and Add!' trajectory (presumably) does not lead to another palindrome.at n=12A070001
• Palindromic even numbers with an odd number of distinct prime factors.at n=32A075809
• Palindromic even numbers with exactly 3 prime factors (counted with multiplicity).at n=37A075816
• 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=23A082941
• Palindromic admirable numbers.at n=12A109759
• Palindromes equal to the sum of a prime number with its index.at n=37A115888
• Expansion of 1/(1-6x*c(7x)), where c(x) is the g.f. of A000108.at n=4A132866
• a(n) = n*F(n) + (n-1)*F(n-1).at n=15A136376
• k such that either 2^k + k - 3 or 2^k + k - 2 is prime.at n=21A237816
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 297", based on the 5-celled von Neumann neighborhood.at n=34A271150
• Number of integer partitions of n such that every orderless pair of distinct parts has a different sum.at n=42A325857
• Palindromes that can be written as the sum of two palindromic primes.at n=49A356824
• Steinhaus-Johnson-Trotter rank of the Eytzinger array layout of n elements.at n=8A370006