login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068907 Number of partitions of n modulo 3. 9
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

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

LINKS

Table of n, a(n) for n=0..104.

Henry Bottomley, Partition calculators using java applets

Index entries for sequences related to partitions

FORMULA

a(n) = A010872(A000041(n)) = A068906(3, n)

a(n) = Pm(n,1) with Pm(n,k) = if k<n then (Pm(n-k,k) + Pm(n,k+1)) mod 3 else 0^(n*(k-n)). - Reinhard Zumkeller, Jun 09 2009

MATHEMATICA

Table[ Mod[ PartitionsP@ n, 3], {n, 105}] (* Robert G. Wilson v, Mar 25 2011 *)

CROSSREFS

Cf. A040051, A068908, A068909, A020919.

Sequence in context: A294658 A127543 A280830 * A219762 A227696 A033687

Adjacent sequences:  A068904 A068905 A068906 * A068908 A068909 A068910

KEYWORD

nonn

AUTHOR

Henry Bottomley, Mar 05 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 14 19:47 EDT 2020. Contains 336483 sequences. (Running on oeis4.)