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.

Showing 1-1 of 1 results.

A206558 Number of 8's in the last section of the set of partitions of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 2, 4, 4, 8, 8, 13, 15, 23, 26, 38, 45, 63, 74, 101, 120, 160, 191, 248, 298, 383, 457, 579, 694, 868, 1038, 1287, 1536, 1890, 2251, 2746, 3267, 3962, 4698, 5665, 6706, 8043, 9496, 11337, 13354, 15876, 18657, 22089
Offset: 1

Views

Author

Omar E. Pol, Feb 09 2012

Keywords

Comments

Zero together with the first differences of A024792. Also number of occurrences of 8 in all partitions of n that do not contain 1 as a part. For the definition of "last section of n" see A135010. It appears that the sums of eight successive terms give the partition numbers A000041.

Crossrefs

Programs

  • Sage
    A206558 = lambda n: sum(list(p).count(8) for p in Partitions(n) if 1 not in p)

Formula

It appears that A000041(n) = Sum_{j=1..8} a(n+j), n >= 0.
Showing 1-1 of 1 results.