29992
domain: N
Appears in sequences
- Number of partitions of n into parts not of the form 23k, 23k+5 or 23k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=41A035993
- Smallest palindrome with digit sum = n.at n=31A062388
- Smallest palindromic multiple of n-th prime.at n=37A062888
- Palindromes k such that k + 11 is also a palindrome.at n=25A082275
- 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=28A082941
- Number of base 20 circular n-digit numbers with adjacent digits differing by 2 or less.at n=6A124948
- Partial sums of floor(n^3/3).at n=24A173707
- Number of partitions p of n such that median(p) < multiplicity(min(p)).at n=42A240212
- Least k such that prime(n) is the smallest prime p for which k^2 + p^2 is also prime, or 0 if none.at n=44A263466
- Number of n X 2 arrays containing 2 copies of 0..n-1 with no equal vertical or antidiagonal neighbors and new values introduced sequentially from 0.at n=6A265677
- T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal vertical or antidiagonal neighbors and new values introduced sequentially from 0.at n=34A265679
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 310", based on the 5-celled von Neumann neighborhood.at n=42A271198
- Numbers k such that 56*10^k - 3 is prime.at n=20A291608
- Palindromes that can be written in more than one way as the sum of two distinct palindromic primes.at n=24A356854
- Palindromes that can be written in more than one way as the sum of two palindromic primes.at n=27A356881