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.

A237278 Numbers k such that A000041(k) == 0 (mod 4).

Original entry on oeis.org

11, 15, 21, 26, 30, 55, 58, 59, 62, 66, 70, 74, 75, 78, 80, 84, 94, 96, 98, 100, 106, 108, 109, 112, 113, 116, 117, 120, 122, 124, 125, 126, 128, 130, 131, 133, 135, 136, 137, 141, 142, 149, 153, 154, 171, 179, 180, 187, 191, 200, 205, 206, 230, 231, 236
Offset: 1

Views

Author

Clark Kimberling, Feb 05 2014

Keywords

Comments

The set of positive integers is partitioned by the sequences A237278-A237281.

Examples

			A000041(11) = 56 == 0 (mod 4).
		

Crossrefs

Cf. A000041, A237276, A237279, A237280, A237281, A243935 (see crossrefs).
Cf. A121062.

Programs

  • Mathematica
    f[n_, k_] := Select[Range[250], Mod[PartitionsP[#], n] == k &]
    Table[f[4, k], {k, 0, 3}] (* A237278-A237281 *)
  • PARI
    is(n)=numbpart(n)%4==0 \\ Charles R Greathouse IV, Apr 08 2015