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!)
A100483 a(1) = 2; a(n+1) = sum{k=1..n} floor(a(n+1-k)/k). 0

%I

%S 2,2,3,4,5,8,11,17,25,39,59,93,146,229,361,569,898,1419,2243,3546,

%T 5608,8869,14029,22191,35105,55531,87846,138967,219844,347785,550183,

%U 870372,1376909,2178235,3445913,5451350,8623906,13642815,21582611,34143185

%N a(1) = 2; a(n+1) = sum{k=1..n} floor(a(n+1-k)/k).

%p a[1]:=2: for n from 2 to 45 do a[n]:=sum(floor(a[n-k]/k),k=1..n-1) od:seq(a[n],n=1..45);

%K easy,nonn

%O 1,1

%A _Leroy Quet_, Nov 22 2004

%E More terms from _Emeric Deutsch_, Dec 09 2004

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 March 21 07:49 EDT 2023. Contains 361393 sequences. (Running on oeis4.)