login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114091 Number of partitions of n into parts that are distinct mod 3. 0
1, 1, 2, 2, 2, 4, 3, 3, 7, 4, 4, 11, 5, 5, 16, 6, 6, 22, 7, 7, 29, 8, 8, 37, 9, 9, 46, 10, 10, 56, 11, 11, 67, 12, 12, 79, 13, 13, 92, 14, 14, 106, 15, 15, 121, 16, 16, 137, 17, 17 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..50.

EXAMPLE

a(5)=2 because there are 2 such partition of 5: {5}, {2,3}.

MATHEMATICA

<< DiscreteMath`Combinatorica`; np[n_]:= Length@Select[Mod[ #, 3]& /@ Partitions[n], (Length@# != Length@Union@#)&]; lst = Array[np, 50]

CROSSREFS

Sequence in context: A050493 A085454 A083403 * A209580 A166008 A194291

Adjacent sequences:  A114088 A114089 A114090 * A114092 A114093 A114094

KEYWORD

nonn

AUTHOR

Giovanni Resta, Feb 06 2006

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 October 22 00:52 EDT 2019. Contains 328315 sequences. (Running on oeis4.)