This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A116554 Anti-Harborth alternating chaotic sequence, 5th type. 6
 1, 7, 8, 49, 57, 56, 71, 343, 400, 399, 505, 392, 505, 497, 624, 2401, 2815, 2800, 3543, 2793, 3592, 3535, 4439, 2744, 3641, 3535, 4432, 3479, 4481, 4368, 5489, 16807, 19832, 19705, 24921, 19600, 25215, 24801, 31144, 19551, 25887, 25144, 31529 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS G. C. Greubel, Table of n, a(n) for n = 0..2500 H. Harborth, Number of Odd Binomial Coefficients, Proc. Amer. Math. Soc. 62, 19-22, 1977. Eric Weisstein's World of Mathematics, Stolarsky-Harborth Constant FORMULA From G. C. Greubel, Oct 30 2016: (Start) a(2*n+1) = 7*a(n). a(2*n+2) = 8*a(n) + a(n-1). (End) MATHEMATICA b[0] := 0; b[1] := 1; b[n_?EvenQ] := b[n] = 7*b[n/2]; b[n_?OddQ] := b[n] = 8*b[(n - 1)/2] + b[(n - 3)/2]; a = Table[b[n], {n, 1, 70}] CROSSREFS Cf. A116528, A116529, A116552, A116553, A116555. Sequence in context: A033044 A025630 A036566 * A038274 A201919 A249310 Adjacent sequences:  A116551 A116552 A116553 * A116555 A116556 A116557 KEYWORD nonn,obsc AUTHOR Roger L. Bagula, Mar 15 2006 EXTENSIONS Edited by N. J. A. Sloane, Fab 11 2007 Name changed by G. C. Greubel, Oct 30 2016 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 December 15 09:53 EST 2018. Contains 318148 sequences. (Running on oeis4.)