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, thereafter a(n) = Sum_{k=1..n-1} floor(a(n-k)/k). 2

%I #14 Apr 05 2023 09:15:12

%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, thereafter a(n) = Sum_{k=1..n-1} floor(a(n-k)/k).

%H G. C. Greubel, <a href="/A100483/b100483.txt">Table of n, a(n) for n = 1..1000</a>

%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);

%t a[n_]:= a[n]= If[n==1, 2, Sum[Floor[a[n-k]/k], {k, n-1}]];

%t Table[a[n], {n, 50}] (* _G. C. Greubel_, Apr 05 2023 *)

%o (SageMath)

%o @CachedFunction

%o def a(n): # a = A100483

%o if (n==1): return 2

%o else: return sum( (a(n-k)//k) for k in range(1,n) )

%o [a(n) for n in range(1,51)] # _G. C. Greubel_, Apr 05 2023

%Y Cf. A100482.

%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 April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)