login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A216607 The sequence used to represent partition binary diagram as an array. 2
0, 0, 1, 0, 1, 0, 2, 1, 0, 2, 1, 0, 3, 2, 1, 0, 3, 2, 1, 0, 4, 3, 2, 1, 0, 4, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 6, 5, 4, 3, 2, 1, 0, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 8, 7, 6, 5, 4, 3, 2, 1, 0, 8, 7, 6, 5, 4, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

COMMENTS

This sequence differs from A025672 first at index n=110.

LINKS

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

Mircea Merca, Binary Diagrams for Storing Ascending Compositions, Comp. J., 2012

FORMULA

a(n) = floor((1/4)*ceiling(sqrt(4*n))^2) - n.

a(n^2) = a(n^2+n) = 0.

MAPLE

seq(floor((1/4)*ceil(sqrt(4*n))^2)-n, n=1..50)

PROG

(PARI) A216607(n)=floor((1/4)*ceil(sqrt(4*n))^2)-n;

CROSSREFS

Sequence in context: A128313 A283486 A330759 * A025672 A025665 A025841

Adjacent sequences:  A216604 A216605 A216606 * A216608 A216609 A216610

KEYWORD

nonn,easy

AUTHOR

Mircea Merca, Sep 10 2012

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 May 31 17:46 EDT 2020. Contains 334748 sequences. (Running on oeis4.)