This site is supported by donations to The OEIS Foundation.

 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
 1, 2, 3, 8, 15, 30, 63, 128, 252, 510, 1012, 2028, 4056, 8120, 16230, 32464, 64923, 129852, 259711, 519420, 1038828, 2077658, 4155318, 8310648, 16621300, 33242586, 66485178, 132970348, 265940701, 531881400, 1063762799, 2127525600 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Michael De Vlieger, Table of n, a(n) for n = 1..3322 FORMULA a(1)=1, a(n) = n * ceiling(sum{k=1 to n-1} a(k) /n). MATHEMATICA f[l_List] := Block[{n = Length[l] + 1}, Append[l, n*(Ceiling[Plus @@ l/n])]]; Nest[f, {1}, 33] (* Ray Chandler, Feb 12 2007 *) Fold[Append[#1, #2 Ceiling@ Total[#1/#2]] &, {1}, Range[2, 32]] (* Michael De Vlieger, Oct 11 2017 *) CROSSREFS Cf. A128020, A128023. Sequence in context: A026698 A099428 A099920 * A011946 A195095 A166920 Adjacent sequences:  A128019 A128020 A128021 * A128023 A128024 A128025 KEYWORD easy,nonn AUTHOR Leroy Quet, Feb 11 2007 EXTENSIONS Extended by Ray Chandler, Feb 12 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 19 04:39 EDT 2019. Contains 327187 sequences. (Running on oeis4.)