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.
%I A155972 #9 Jul 22 2025 06:20:18
%S A155972 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,
%T A155972 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,
%U A155972 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
%N A155972 The Partition Ruler.
%C A155972 a(k) = 1 if k = A000070(n) - 1 for some n >= 0 otherwise 0.
%C A155972 Is this the same as A134286? - _N. J. A. Sloane_, Feb 02 2009
%e A155972 .1,
%e A155972 .1,
%e A155972 .0, 1,
%e A155972 .0, 0, 1,
%e A155972 .0, 0, 0, 0, 1,
%t A155972 a70[n_] := a70[n] = PartitionsP[Range[0, n]] // Total;
%t A155972 a[k_] := AnyTrue[Range[0, k], k == a70[#]-1&] // Boole;
%t A155972 Table[a[k], {k, 0, 96}] (* _Jean-François Alcover_, Jun 19 2019 *)
%Y A155972 Cf. A000070, A000041.
%K A155972 nonn,tabf
%O A155972 0,1
%A A155972 _Peter Luschny_, Jan 31 2009