

A097046


a(n) = a(n1) + 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



FORMULA

a(1)=1; a(n) = a(n1) + a(floor(sqrt(n))) for n > 1.


MAPLE

a:= proc(n) option remember;
`if`(n<2, 1, a(n1)+a(floor(sqrt(n))))
end:


CROSSREFS

Cf. A097045 ( a(n1)  a(floor(sqrt(n))) ).


KEYWORD

nonn


AUTHOR



STATUS

approved



