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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A115638 A Jacobsthal-related divide-and-conquer sequence. 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; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Partial sums are A115637. LINKS Antti Karttunen, Table of n, a(n) for n = 0..1024 R. Stephan, Divide-and-conquer generating functions. I. Elementary sequences, arXiv:math/0307027 [math.CO], 2003. 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) - 4*x^2*G(x^2) = 1/(1+x). a(0) = 1; for n >= 1, a(n) = A115637(n) - A115637(n-1). - Antti Karttunen, Nov 02 2018 PROG (PARI) A115638(n) = if(!n, 1, A115637(n)-A115637(n-1)); \\ (Needs also code from A115637) - Antti Karttunen, Nov 02 2018 CROSSREFS Cf. A001045, A115637. Sequence in context: A155059 A206076 A329374 * A342375 A055515 A338096 Adjacent sequences:  A115635 A115636 A115637 * A115639 A115640 A115641 KEYWORD easy,sign AUTHOR Paul Barry, Jan 27 2006 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.

Last modified June 18 07:25 EDT 2021. Contains 345098 sequences. (Running on oeis4.)