The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A128022 a(1)=1, a(n) = the multiple of n which is >= (sum{k=1 to n-1} a(k)) and is < (n + sum{k=1 to n-1} a(k)). 4

%I #10 Oct 11 2017 21:58:00

%S 1,2,3,8,15,30,63,128,252,510,1012,2028,4056,8120,16230,32464,64923,

%T 129852,259711,519420,1038828,2077658,4155318,8310648,16621300,

%U 33242586,66485178,132970348,265940701,531881400,1063762799,2127525600

%N a(1)=1, a(n) = the multiple of n which is >= (sum{k=1 to n-1} a(k)) and is < (n + sum{k=1 to n-1} a(k)).

%H Michael De Vlieger, <a href="/A128022/b128022.txt">Table of n, a(n) for n = 1..3322</a>

%F a(1)=1, a(n) = n * ceiling(sum{k=1 to n-1} a(k) /n).

%t f[l_List] := Block[{n = Length[l] + 1}, Append[l, n*(Ceiling[Plus @@ l/n])]]; Nest[f, {1}, 33] (* _Ray Chandler_, Feb 12 2007 *)

%t Fold[Append[#1, #2 Ceiling@ Total[#1/#2]] &, {1}, Range[2, 32]] (* _Michael De Vlieger_, Oct 11 2017 *)

%Y Cf. A128020, A128023.

%K easy,nonn

%O 1,2

%A _Leroy Quet_, Feb 11 2007

%E Extended by _Ray Chandler_, Feb 12 2007

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 June 6 08:24 EDT 2024. Contains 373117 sequences. (Running on oeis4.)