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

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A108171 Tribonacci version of A076662 using beta positive real Pisot root of x^3 - x^2 - x - 1. 0
 4, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 3, 3, 4, 3, 4, 3, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Three part composition of sequence based on the Fibonacci substitution twos order. LINKS FORMULA b(n) = 1 + ceiling((n-1)*beta); a(n) = b(n) - b(n-1). MATHEMATICA NSolve[x^3 - x^2 - x - 1 = 0, x] beta = 1.8392867552141612 a[n_] = 1 + Ceiling[(n - 1)*beta^2] (* A007066 like*) aa = Table[a[n], {n, 1, 100}] (* A076662-like *) b = Table[a[n] - a[n - 1], {n, 2, Length[aa]}] F[1] = 2; F[n_] := F[n] = F[n - 1] + b[[n]] (* A000195-like *) c = Table[F[n], {n, 1, Length[b] - 1}] CROSSREFS Cf. A007066, A076662, A000195. Sequence in context: A106049 A238234 A136627 * A231475 A106055 A171783 Adjacent sequences:  A108168 A108169 A108170 * A108172 A108173 A108174 KEYWORD nonn,uned AUTHOR Roger L. Bagula, Jun 13 2005 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 November 26 22:26 EST 2020. Contains 338652 sequences. (Running on oeis4.)