The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A373097 a(n) = a[n/r] + a[n/r^2] + a[n/r^3] + ... , where a(0) = 0, a(1) = 1, r = 3/2, and [ ] = floor. 2
 0, 1, 1, 2, 3, 4, 6, 7, 9, 12, 12, 14, 18, 18, 24, 24, 26, 29, 36, 36, 36, 48, 48, 49, 52, 54, 59, 72, 72, 72, 72, 78, 96, 96, 96, 98, 104, 104, 109, 118, 118, 144, 144, 144, 144, 144, 150, 156, 192, 192, 192, 192, 194, 196, 208, 208, 210, 218, 222, 236, 236 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS Conjecture: Let d(n) = a(n+1) - a(n) for n >= 0. Then d(n) = 1 for infinitely many n, and (d(n)) is unbounded. LINKS Table of n, a(n) for n=0..60. MATHEMATICA a[0] = 0; a[1] = 1; a[n_] := a[n] = Sum[a[Floor[n/(3/2)^k]], {k, 1, n}] Table[a[n], {n, 0, 400}] CROSSREFS Cf. A000045, A373095, A373096. Sequence in context: A097987 A049149 A332555 * A304206 A243498 A156287 Adjacent sequences: A373094 A373095 A373096 * A373098 A373099 A373100 KEYWORD nonn AUTHOR Clark Kimberling, Jul 22 2024 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.

Last modified September 18 03:51 EDT 2024. Contains 375995 sequences. (Running on oeis4.)