20451

Appears in sequences

• A Fielder sequence: a(n) = a(n-1) + a(n-2) - a(n-7), n >= 8.at n=21A001636
• Number of partitions of floor(5n/2) into n nonnegative integers each no more than 5.at n=42A001975
• Numbers that are the sum of 6 nonzero 8th powers.at n=21A003384
• a(n) = Sum_{k=0..n} T(n,k), T given by A026780.at n=12A026787
• Position where n (presumably) appears the last time in A107261, or 0 if n keeps appearing.at n=16A107262
• Number of strictly increasing arrangements of 5 numbers in -(n+3)..(n+3) with sum zero.at n=19A188183
• Sum of distinct nonzero sixth powers.at n=28A194769
• Number of n X 5 0..1 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=41A201501
• Least number k such that k^n + k +/- 1 are twin primes, or 0 if no such k exists.at n=38A248081
• Main diagonal of A332367, divided by 4.at n=25A332368
• Odd composite numbers k such that A053575(k) [the odd part of phi] divides k-1.at n=46A339880
• Number of length n strings on the alphabet {0,1,2,3} with digit sum at most 4.at n=24A363256
• a(n) is the number of distinct five-cuboid combinations filling n X n X n cube without allowing a cut spanning through the full cube in any of filling positions.at n=24A384743