cp's OEIS Frontend

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

%I A097046 #5 Apr 09 2021 20:16:05
%S A097046 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,
%T A097046 93,100,107,114,121,128,135,142,149,156,165,174,183,192,201,210,219,
%U A097046 228,237,246,255,264,273,284,295,306,317,328,339,350,361,372,383,394,405
%N A097046 a(n) = a(n-1) + a(floor(sqrt(n))) for n > 1; a(1) = 1.
%C A097046 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.
%H A097046 Alois P. Heinz, <a href="/A097046/b097046.txt">Table of n, a(n) for n = 1..10000</a>
%F A097046 a(1)=1; a(n) = a(n-1) + a(floor(sqrt(n))) for n > 1.
%p A097046 a:= proc(n) option remember;
%p A097046      `if`(n<2, 1, a(n-1)+a(floor(sqrt(n))))
%p A097046     end:
%p A097046 seq(a(n), n=1..80);  # _Alois P. Heinz_, Apr 09 2021
%Y A097046 Cf. A097045 ( a(n-1) - a(floor(sqrt(n))) ).
%K A097046 nonn
%O A097046 1,2
%A A097046 _Rick L. Shepherd_, Jul 20 2004