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.

A026926 Number of partitions of n into an odd number of parts, the greatest being 6; also, a(n+11) = number of partitions of n+5 into an even number of parts, each <=6.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 1, 1, 3, 3, 6, 7, 11, 12, 18, 21, 30, 34, 46, 54, 70, 80, 101, 116, 143, 163, 197, 225, 269, 303, 357, 403, 469, 525, 606, 677, 774, 860, 976, 1082, 1221, 1346, 1509, 1661, 1852, 2029, 2252, 2462, 2720, 2964, 3261
Offset: 1

Views

Author

Keywords

Crossrefs

6th column of A026920.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],#[[1]]==6&&OddQ[Length[#]]&]],{n,60}] (* Harvey P. Dale, Dec 31 2022 *)