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!)
A100482 a(1) = 1 thereafter a(n) = Sum_{k=1..n-1} ceiling(a(n-k)/k). 2
1, 1, 2, 4, 7, 12, 21, 34, 55, 88, 143, 227, 361, 572, 908, 1439, 2279, 3607, 5709, 9033, 14294, 22615, 35779, 56605, 89551, 141671, 224123, 354561, 560908, 887349, 1403769, 2220732, 3513150, 5557727, 8792198, 13909056, 22003809, 34809516 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
MAPLE
a[1]:=1: for n from 2 to 40 do a[n]:=sum(ceil(a[n-k]/k), k=1..n-1) od:seq(a[n], n=1..40);
MATHEMATICA
a[n_]:= a[n]= If[n==1, 1, Sum[Ceiling[a[n-k]/k], {k, n-1}]];
Table[a[n], {n, 50}] (* G. C. Greubel, Apr 05 2023 *)
PROG
(SageMath)
@CachedFunction
def a(n): # a = A100482
if (n==1): return 1
else: return sum( ((a(n-k)+k-1)//k) for k in range(1, n) )
[a(n) for n in range(1, 51)] # G. C. Greubel, Apr 05 2023
CROSSREFS
Cf. A100483.
Sequence in context: A168368 A305106 A182746 * A301762 A003293 A192759
KEYWORD
easy,nonn
AUTHOR
Leroy Quet, Nov 22 2004
EXTENSIONS
More terms from Emeric Deutsch, Dec 09 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 14:51 EDT 2024. Contains 371749 sequences. (Running on oeis4.)