The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140474 Fractional noise-like sequence: a(n)=a(n-a(n-1))+a(Floor[a0*n/b0]): a0<b0:a0=1;b0=8. 0
1, 0, 1, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 9, 9, 11, 10, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 14, 12, 14, 13, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 17, 15, 17, 15, 17, 16, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
Two general types seem to exist:
1) a(n)=a(n-a(n-1))+a(Floor[a0*n/b0]): a0<b0 ( noise-like)
2) a(n)=a(Floor[a0*n/b0])+a(Floor[c0*n/b0]): c0<a0<b0 ( step-like)
LINKS
FORMULA
a(n)=a(n-a(n-1))+a(Floor[a0*n/b0]): a0<b0:a0=1;b0=8
MATHEMATICA
a[0] = 1; a[1] = 0; a[2] = 1; a[n_] := a[n] = a[n - a[n - 1]] + a[Floor[n/8]] b = Table[a[n], {n, 0, 200}]
CROSSREFS
Cf. A004001.
Sequence in context: A063510 A156878 A214454 * A091195 A280617 A072375
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 16:26 EDT 2024. Contains 372554 sequences. (Running on oeis4.)