Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116554
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116554 Let a[0] = 0, a[1] = 1. For n >= 2, if n even then a[n] = 7*a[n/2], otherwise a[n] = 8*a[(n - 1)/2] + a[(n - 3)/2]. +0
1
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; listen)
OFFSET

0,2

COMMENT

Alternating chaotic sequence, anti-Harborth form, 5th type.

REFERENCES

Harborth, H. Number of Odd Binomial Coefficients. Proc. Amer. Math. Soc. 62, 19-22, 1977

LINKS

Eric Weisstein's World of Mathematics, Stolarsky-Harborth Constant

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

Adjacent sequences: A116551 A116552 A116553 this_sequence A116555 A116556 A116557

Sequence in context: A033044 A025630 A036566 this_sequence A038274 A094556 A041023

KEYWORD

nonn

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Mar 15 2006

EXTENSIONS

Edited by njas, Fab 11 2007

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research