21133

Appears in sequences

• Number of partitions of n into parts not of the form 11k, 11k+2 or 11k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 4 are greater than 1.at n=47A035945
• Base-8 palindromes that start with 5.at n=28A043025
• a(n) = floor( n^e ), e = 2.718281828...at n=38A061293
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k doubledescents (i.e., dd's).at n=47A108428
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k doubledescents (i.e., dd's).at n=52A108428
• a(n) = A000043(n) written in base 4.at n=13A161322
• Number of partitions of n^3 into distinct cubes > 1.at n=44A298848