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!)
 A071996 a(1) = 0, a(2) = 1, a(n) = a(floor(n/3)) + a(n - floor(n/3)). 4
 0, 1, 1, 1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 6, 7, 8, 8, 9, 9, 9, 9, 9, 9, 9, 10, 11, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 15, 16, 16, 17, 17, 18, 18, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 20, 20, 21, 22, 23, 24, 24, 24, 25, 26, 26, 27 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS "Rauzy's sequence" with initial values 0, 1. David Moews showed that a(n)/n converges to about 0.31244. - Jim Nastos, Jan 08 2003 Difference of consecutive terms is always 0 or 1 LINKS Gheorghe Coserea, Table of n, a(n) for n = 1..10000 David Moews, Asymptotic behavior of Rauzy's sequence Jeffrey Shallit, Ten Problems I Can't Solve (1.1MB ps) MATHEMATICA a[1]=0; a[2]=1; a[n_] := a[n]=a[Floor[n/3]]+a[n-Floor[n/3]]; Table[a[n], {n, 1, 75}] PROG (PARI) n = 33; v = vector(n); v[1] = 'x; v[2] = 'y; for(i = 3, n, v[i] = v[floor(i/3)] + v[i - floor(i/3)]); apply(e -> polcoeff(e, 1, v[2]), v) \\ Gheorghe Coserea, Aug 22 2015 CROSSREFS Cf. A071991, A071995. Sequence in context: A182009 A034463 A259899 * A072747 A194295 A194287 Adjacent sequences:  A071993 A071994 A071995 * A071997 A071998 A071999 KEYWORD easy,nonn AUTHOR Jim Nastos, Jun 17 2002 EXTENSIONS Edited by Robert G. Wilson v, Jun 23 2002 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 April 15 07:23 EDT 2021. Contains 342975 sequences. (Running on oeis4.)