The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The set of positive integers is partitioned by A083214, A237276, and A237277. LINKS Clark Kimberling, Table of n, a(n) for n = 1..1000 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 Cf. A000041, A083214, A237277. Sequence in context: A196934 A359949 A291752 * A155086 A219049 A245534 Adjacent sequences: A237273 A237274 A237275 * A237277 A237278 A237279 KEYWORD nonn,easy AUTHOR Clark Kimberling, Feb 05 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 23 16:36 EDT 2024. Contains 372765 sequences. (Running on oeis4.)