cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A218569 Number of partitions p of n such that max(p)-min(p) = 6.

Original entry on oeis.org

1, 1, 3, 3, 7, 8, 14, 18, 27, 33, 49, 59, 81, 100, 131, 158, 205, 243, 306, 365, 448, 527, 642, 748, 896, 1042, 1231, 1418, 1667, 1906, 2215, 2527, 2909, 3298, 3781, 4260, 4847, 5446, 6158, 6886, 7756, 8633, 9669, 10738, 11970, 13239, 14713, 16212, 17943
Offset: 8

Views

Author

Alois P. Heinz, Nov 02 2012

Keywords

Programs

Formula

G.f.: Sum_{k>0} x^(2*k+6)/Product_{j=0..6} (1-x^(k+j)).
a(n) = A097364(n,6) = A116685(n,6) = A194621(n,6) - A194621(n,5) = A218508(n) - A218507(n).