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.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A097046 a(n) = a(n-1) + a(floor(sqrt(n))) for n > 1; a(1) = 1. 3
 1, 2, 3, 5, 7, 9, 11, 13, 16, 19, 22, 25, 28, 31, 34, 39, 44, 49, 54, 59, 64, 69, 74, 79, 86, 93, 100, 107, 114, 121, 128, 135, 142, 149, 156, 165, 174, 183, 192, 201, 210, 219, 228, 237, 246, 255, 264, 273, 284, 295, 306, 317, 328, 339, 350, 361, 372, 383, 394, 405 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS By definition, this sequence consists of an infinite sequence of finite subsequences of increasing lengths with common differences a(1), a(2), a(3), ..., respectively. LINKS Alois P. Heinz, Table of n, a(n) for n = 1..10000 FORMULA a(1)=1; a(n) = a(n-1) + a(floor(sqrt(n))) for n > 1. MAPLE a:= proc(n) option remember; `if`(n<2, 1, a(n-1)+a(floor(sqrt(n)))) end: seq(a(n), n=1..80); # Alois P. Heinz, Apr 09 2021 CROSSREFS Cf. A097045 ( a(n-1) - a(floor(sqrt(n))) ). Sequence in context: A287374 A186390 A022554 * A248420 A011861 A229511 Adjacent sequences: A097043 A097044 A097045 * A097047 A097048 A097049 KEYWORD nonn AUTHOR Rick L. Shepherd, Jul 20 2004 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 May 27 12:58 EDT 2024. Contains 372859 sequences. (Running on oeis4.)