cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A237277 Numbers k such that A000041(k) == 2 (mod 3).

Original entry on oeis.org

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
Offset: 1

Views

Author

Clark Kimberling, Feb 05 2014

Keywords

Comments

The set of positive integers is partitioned by A083214, A237276, and A237277.

Examples

			A000041(6) = 11 == 2 (mod 3).
		

Crossrefs

Programs

  • 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 *)