login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A114092
Number of partitions of n into parts that are distinct mod 4.
2
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, 104, 92, 105, 469, 119, 106, 120, 575, 135, 121, 136, 696, 152
OFFSET
0,4
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..10000 (terms n = 1..2000 from Fausto A. C. Cariboni)
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: A326670 A361178 A307993 * A082500 A194451 A059292
KEYWORD
nonn
AUTHOR
Giovanni Resta, Feb 06 2006
EXTENSIONS
a(0)=1 prepended by Alois P. Heinz, Jan 23 2021
STATUS
approved