Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115637
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115637 A divide-and-conquer sequence. +0
3
1, 0, 5, 4, 1, 0, 21, 20, 17, 16, 5, 4, 1, 0, 85, 84, 81, 80, 69, 68, 65, 64, 21, 20, 17, 16, 5, 4, 1, 0, 341, 340, 337, 336, 325, 324, 321, 320, 277, 276, 273, 272, 261, 260, 257, 256, 85, 84, 81, 80, 69, 68, 65, 64, 21, 20, 17, 16, 5, 4, 1, 0, 1365, 1364, 1361, 1360, 1349 (list; graph; listen)
OFFSET

0,3

COMMENT

Row sums of number triangle A115636. Partial sums of A115638.

LINKS

R. Stephan, Divide-and-conquer generating functions. I. Elementary sequences

FORMULA

G.f.: (1/(1-x))*sum{k>=0, 4^k*x^(2^(k+1)-2)/(1+x^(2^k))}; The g.f. G(x) satisfies G(x)-4(1+x)*x^2*G(x^2)=1/(1-x^2);

CROSSREFS

Adjacent sequences: A115634 A115635 A115636 this_sequence A115638 A115639 A115640

Sequence in context: A128355 A129522 A133842 this_sequence A124602 A132707 A046575

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Jan 27 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research