|
Search: id:A114091
|
|
|
| A114091 |
|
Number of partitions of n into parts that are distinct mod 3. |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
1,3
|
|
|
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 this_sequence A070867 A029157 A031437
Adjacent sequences: A114088 A114089 A114090 this_sequence A114092 A114093 A114094
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Giovanni Resta (g.resta(AT)iit.cnr.it), Feb 06 2006
|
|
|
Search completed in 0.002 seconds
|
