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 A134286 #14 Sep 25 2024 14:52:46 %S A134286 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, %T A134286 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, %U A134286 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,0,0,0,0,0,0,0,0,0 %N A134286 Characteristic sequence for sequence A026905. %C A134286 This partition array is the member k=1 in the family M_0(k), with M_0(2)=M_0= A048996, M_0(3)= A134283, etc. %C A134286 When read as partition array (tabf with sequence of row lengths given by the partition numbers A000041) in Abramowitz-Stegun order (see A117506 for the reference) a(n,k) is the characteristic partition array for the partition (1^n) of n. %H A134286 M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy]. %H A134286 <a href="/index/Ch#char_fns">Index entries for characteristic functions</a> %F A134286 a(n)=1 if n from A026905, else 0. %t A134286 terms = 105; nmax = 10; %t A134286 pp = PartitionsP[Range[nmax]] // Accumulate; %t A134286 a[n_] := If[n > pp[[-1]], Print["nmax = ", nmax, " too small"], Boole[ MemberQ[ pp, n]]]; %t A134286 Array[a, terms] (* _Jean-François Alcover_, Jun 19 2019 *) %K A134286 nonn,easy,tabf %O A134286 1,1 %A A134286 _Wolfdieter Lang_, Nov 13 2007