Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116601
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116601 a(0) = a(1) = 0; for n >= 2, a(n) = floor(sqrt(2^(n-2)-1)). +0
1
0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 15, 22, 31, 45, 63, 90, 127, 181, 255, 362, 511, 724, 1023, 1448, 2047, 2896, 4095, 5792, 8191, 11585, 16383, 23170, 32767, 46340, 65535, 92681, 131071, 185363, 262143, 370727, 524287, 741455, 1048575, 1482910, 2097151, 2965820, 4194303, 5931641 (list; graph; listen)
OFFSET

0,6

COMMENT

Produced by a Markov chain and designed to have a Sqrt[2] limiting ratio.

FORMULA

M = {{3, 1}, {1, 3}}/N[Sqrt[8]]: Det[M]=1; w[0] = {0, 1}; w[n_] := w[n] = M.w[n - 1] a(n) = Floor[w[n][[1]]]

MATHEMATICA

M = {{3, 1}, {1, 3}}/N[Sqrt[8]] w[0] = {0, 1}; w[n_] := w[n] = M.w[n - 1] a0 = Table[Floor[w[n][[1]]], {n, 0, 25}] b0 = Table[N[a0[[n + 1]]/a0[[n]]], {n, 4, 24}]

CROSSREFS

Cf. A000225.

Sequence in context: A091582 A101977 A024793 this_sequence A024792 A055771 A052955

Adjacent sequences: A116598 A116599 A116600 this_sequence A116602 A116603 A116604

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Edited by njas, May 10 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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research