The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A237277 Numbers k such that A000041(k) == 2 (mod 3). 2
 2, 4, 6, 11, 12, 13, 15, 25, 29, 31, 38, 42, 47, 49, 56, 58, 60, 65, 66, 67, 69, 74, 76, 78, 79, 83, 84, 85, 87, 90, 92, 93, 94, 96, 101, 103, 105, 108, 109, 114, 120, 121, 123, 126, 127, 130, 131, 132, 135, 136, 141, 144, 145, 153, 156, 159, 165, 167, 171 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 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(6) = 11 == 2 (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, A237276. Sequence in context: A279911 A063183 A057661 * A097954 A324333 A081988 Adjacent sequences:  A237274 A237275 A237276 * A237278 A237279 A237280 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 24 19:27 EDT 2021. Contains 347651 sequences. (Running on oeis4.)