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”).

A237276
Numbers k such that A000041(k) == 1 (mod 3).
6
1, 5, 8, 18, 19, 23, 27, 28, 34, 36, 37, 44, 45, 50, 54, 55, 59, 62, 64, 72, 73, 77, 81, 82, 86, 89, 91, 95, 98, 99, 100, 110, 112, 113, 116, 117, 118, 119, 122, 128, 134, 137, 139, 140, 143, 146, 148, 149, 150, 152, 154, 155, 157, 158, 161, 166, 168, 170
OFFSET
1,2
COMMENTS
The set of positive integers is partitioned by A083214, A237276, and A237277.
LINKS
EXAMPLE
A000041(8) = 22 == 1 (mod 3).
MATHEMATICA
f[n_, k_] := Select[Range[250], Mod[PartitionsP[#], n] == k &]
Table[f[3, k], {k, 0, 2}] (* A083214, A237276, A237277 *)
Table[f[4, k], {k, 0, 3}] (* A237278-A237281 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Feb 05 2014
STATUS
approved