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.

A155972 The Partition Ruler.

Original entry on oeis.org

1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
Offset: 0

Views

Author

Peter Luschny, Jan 31 2009

Keywords

Comments

a(k) = 1 if k = A000070(n) - 1 for some n >= 0 otherwise 0.
Is this the same as A134286? - N. J. A. Sloane, Feb 02 2009

Examples

			.1,
.1,
.0, 1,
.0, 0, 1,
.0, 0, 0, 0, 1,
		

Crossrefs

Programs

  • Mathematica
    a70[n_] := a70[n] = PartitionsP[Range[0, n]] // Total;
    a[k_] := AnyTrue[Range[0, k], k == a70[#]-1&] // Boole;
    Table[a[k], {k, 0, 96}] (* Jean-François Alcover, Jun 19 2019 *)