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!)
 A108175 Three-step constructive order sequence. 0
 3, 6, 11, 16, 20, 24, 28, 31, 36, 41, 46, 51, 56, 60, 65, 70, 75, 79, 84, 89, 94, 99, 103, 108, 113, 118, 122, 127, 132, 137, 142, 146, 149, 154, 158, 161, 165, 168, 172, 177, 180, 185, 190, 195, 199, 202, 206, 211, 216, 220, 224, 227, 230, 235, 238, 241, 246 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Average=4.32323 LINKS FORMULA g[n]=switch between states[0, 1, 2] f[n]=5-Mod[g[n]-g[n-1], 3] a(n) = a[n-1]+f[n] EXAMPLE Modeled on construction of twos order sequence for Fibonacci substitution, this construction of an order sequences produces a lower average than the actual tribonacci ones order sequence. MATHEMATICA beta = x /. NSolve[x^3 - x^2 - x - 1 == 0, x][]; a = 0; a = 4; a[n_] := a[n] = If[Mod[a[n - 1] - a[n - 2], 3] == 0, Ceiling[(n - 1)*beta^3] - 4, If[Mod[a[n - 1] - a[n - 2], 3] == 1, Ceiling[(n-1)*beta] - 1, Ceiling[(n - 1)*beta^2] - 2] ] aa = Table[a[n], {n, 1, 100}]; b = Table[5 - Mod[a[n] - a[n - 1], 3], {n, 2, Length[aa]}]; F = 3; F[n_] := F[n] = F[n - 1] + b[[n]] c = Table[F[n], {n, 1, Length[b] - 1}] CROSSREFS Sequence in context: A310106 A310107 A099951 * A030722 A030720 A310108 Adjacent sequences:  A108172 A108173 A108174 * A108176 A108177 A108178 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 February 23 05:29 EST 2020. Contains 332159 sequences. (Running on oeis4.)