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.

A068907 Number of partitions of n modulo 3.

Original entry on oeis.org

1, 1, 2, 0, 2, 1, 2, 0, 1, 0, 0, 2, 2, 2, 0, 2, 0, 0, 1, 1, 0, 0, 0, 1, 0, 2, 0, 1, 1, 2, 0, 2, 0, 0, 1, 0, 1, 1, 2, 0, 0, 0, 2, 0, 1, 1, 0, 2, 0, 2, 1, 0, 0, 0, 1, 1, 2, 0, 2, 1, 2, 0, 1, 0, 1, 2, 2, 2, 0, 2, 0, 0, 1, 1, 2, 0, 2, 1, 2, 2, 0, 1, 1, 2, 2, 2, 1, 2, 0, 1, 2, 1, 2, 2, 2, 1, 2, 0, 1, 1, 1, 2, 0, 2, 0
Offset: 0

Views

Author

Henry Bottomley, Mar 05 2002

Keywords

Comments

Of the partitions of numbers from 1 to 100000: 33344 are 0, 33193 are 1 and 33463 are 2 modulo 3.

Crossrefs

Programs

Formula

a(n) = A010872(A000041(n)) = A068906(3, n)
a(n) = Pm(n,1) with Pm(n,k) = if kReinhard Zumkeller, Jun 09 2009