Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115638
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115638 A Jacobsthal-related divide-and-conquer sequence. +0
2
1, -1, 5, -1, -3, -1, 21, -1, -3, -1, -11, -1, -3, -1, 85, -1, -3, -1, -11, -1, -3, -1, -43, -1, -3, -1, -11, -1, -3, -1, 341, -1, -3, -1, -11, -1, -3, -1, -43, -1, -3, -1, -11, -1, -3, -1, -171, -1, -3, -1, -11, -1, -3, -1, -43, -1, -3, -1, -11, -1, -3, -1, 1365, -1, -3, -1, -11, -1, -3, -1, -43 (list; graph; listen)
OFFSET

0,3

COMMENT

Partial sums are A115637.

LINKS

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

FORMULA

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

CROSSREFS

Cf. A001045.

Sequence in context: A134568 A121267 A111740 this_sequence A055515 A136744 A068237

Adjacent sequences: A115635 A115636 A115637 this_sequence A115639 A115640 A115641

KEYWORD

easy,sign

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research