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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083661 G.f.: 1/(1-x) * sum(k>=0, x^2^(k+2)/(1+x^2^k)). 1
0, 0, 0, 1, 0, 1, 0, 2, 1, 1, 0, 2, 1, 1, 0, 3, 2, 2, 1, 2, 1, 1, 0, 3, 2, 2, 1, 2, 1, 1, 0, 4, 3, 3, 2, 3, 2, 2, 1, 3, 2, 2, 1, 2, 1, 1, 0, 4, 3, 3, 2, 3, 2, 2, 1, 3, 2, 2, 1, 2, 1, 1, 0, 5, 4, 4, 3, 4, 3, 3, 2, 4, 3, 3, 2, 3, 2, 2, 1, 4, 3, 3, 2, 3, 2, 2, 1, 3, 2, 2, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,8

LINKS

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

R. Stephan, Some divide-and-conquer sequences ...

R. Stephan, Table of generating functions

FORMULA

a(1)=a(2)=a(3)=0, a(2n) = a(n)+1, a(2n+1) = a(n).

a(n) = A080791(n) + A079944(n-2) - 1.

PROG

(PARI) for(n=1, 120, l=ceil(log(n)/log(2)); t=polcoeff(1/(1-x)*sum(k=0, l, (x^2^(k+2))/(1+x^2^k)) + O(x^(n+1)), n); print1(t", "))

CROSSREFS

Cf. A000120, A023416.

Sequence in context: A060826 A078134 A282380 * A029369 A255315 A125072

Adjacent sequences:  A083658 A083659 A083660 * A083662 A083663 A083664

KEYWORD

nonn,easy

AUTHOR

Ralf Stephan, Jun 14 2003

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 February 18 20:25 EST 2019. Contains 320262 sequences. (Running on oeis4.)