29392

Appears in sequences

• Palindromes of form k*(k+9).at n=6A028571
• Numbers that are palindromic, divisible by 11 and have an odd number of digits.at n=25A045571
• Palindromes with exactly 6 prime factors (counted with multiplicity).at n=14A046332
• Smallest palindromic multiple of n-th prime.at n=38A062888
• Solution to the non-squashing boxes problem (version 1).at n=41A089054
• Palindromes for which the multiplicative digital root is a prime.at n=32A117059
• Biquadrateful (i.e., not biquadrate-free) palindromes.at n=20A133514
• Binomial transform of A000957.at n=10A138415
• a(n) = n*(n+1)*(5*n+7)/6.at n=32A162148
• Number of partitions of n having no parts with multiplicity 8.at n=39A184643
• Triangle read by rows related to enumeration of permutations avoiding certain patterns.at n=46A220860
• The number of binary pattern classes in the (2,n)-rectangular grid with 3 '1's and (2n-3) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=45A225972
• Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component by 1 such that for each point (p_1,p_2,...,p_k) we have abs(p_{i}-p_{i+1}) <= 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=30A227655
• Number of lattice paths from {2}^n to {0}^n using steps that decrement one component by 1 such that for each point (p_1,p_2,...,p_n) we have abs(p_{i}-p_{i+1}) <= 1.at n=5A227656
• Number of lattice paths from {n}^5 to {0}^5 using steps that decrement one component by 1 such that for each point (p_1,p_2,...,p_5) we have abs(p_{i}-p_{i+1}) <= 1.at n=2A227667
• Number of (n+1) X (1+1) 0..3 arrays with no element unequal to a strict majority of its horizontal and vertical neighbors, with values 0..3 introduced in row major order.at n=13A231337
• Row sums of A273751.at n=36A274248
• Sum of the third largest parts in the partitions of n into 7 parts.at n=44A308931
• Numbers k such that A360522(k) = A360522(k+1).at n=28A360527
• Number of n-bit binary reversible primes.at n=21A366910