|
Search: id:A114092
|
|
|
| A114092 |
|
Number of partitions of n into parts that are distinct mod 4. |
|
+0
1
|
|
| 1, 1, 2, 2, 3, 3, 5, 4, 6, 7, 9, 7, 10, 14, 14, 11, 15, 25, 20, 16, 21, 41, 27, 22, 28, 63, 35, 29, 36, 92, 44, 37, 45, 129, 54, 46, 55, 175, 65, 56, 66, 231, 77, 67, 78, 298, 90, 79, 91, 377
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
EXAMPLE
|
a(5)=3 because there are 3 such partition of 5: {5}, {2,3}, {1,4}.
|
|
MATHEMATICA
|
<< DiscreteMath`Combinatorica`; np[n_]:= Length@Select[Mod[ #, 4]& /@ Partitions[n], (Length@# != Length@Union@#)&]; lst = Array[np, 50]
|
|
CROSSREFS
|
Sequence in context: A070230 A007150 A122352 this_sequence A082500 A059292 A115000
Adjacent sequences: A114089 A114090 A114091 this_sequence A114093 A114094 A114095
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Giovanni Resta (g.resta(AT)iit.cnr.it), Feb 06 2006
|
|
|
Search completed in 0.002 seconds
|
