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.

A336767 The number of partitions of n into an even number of parts, each part occurring at most seven times, minus the number of partitions of n into an odd number of parts, each part occurring at most seven times.

Original entry on oeis.org

1, -1, 0, -1, 1, -1, 1, -1, 1, -1, 2, -1, 2, -2, 2, -3, 2, -2, 3, -3, 3, -4, 4, -4, 4, -5, 5, -6, 6, -6, 7, -7, 7, -8, 9, -9, 10, -10, 11, -12, 13, -13, 14, -15, 15, -17, 18, -18, 20, -21, 22, -23, 24, -25, 27, -29, 30, -32, 33, -35, 37, -39, 40, -43, 45, -47, 50
Offset: 0

Views

Author

Jeremy Lovejoy, Aug 04 2020

Keywords

Crossrefs

Formula

G.f.: Product_{n>0} ((1-q^(8*n))/(1+q^n)).