login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134286 Characteristic sequence for sequence A026905. 4
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, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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.

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.

LINKS

Table of n, a(n) for n=1..105.

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].

Index entries for characteristic functions

FORMULA

a(n)=1 if n from A026905, else 0.

MATHEMATICA

terms = 105; nmax = 10;

pp = PartitionsP[Range[nmax]] // Accumulate;

a[n_] := If[n > pp[[-1]], Print["nmax = ", nmax, " too small"], Boole[ MemberQ[ pp, n]]];

Array[a, terms] (* Jean-Fran├žois Alcover, Jun 19 2019 *)

CROSSREFS

Sequence in context: A074381 A179560 A128407 * A023531 A320841 A243148

Adjacent sequences:  A134283 A134284 A134285 * A134287 A134288 A134289

KEYWORD

nonn,easy,tabf

AUTHOR

Wolfdieter Lang Nov 13 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 13 23:48 EST 2019. Contains 329106 sequences. (Running on oeis4.)