login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128020 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)). 2
1, 2, 6, 12, 25, 48, 98, 200, 396, 790, 1584, 3168, 6331, 12670, 25335, 50672, 101354, 202698, 405403, 810800, 1621599, 3243196, 6486391, 12972792, 25945575, 51891164, 103782330, 207564644, 415129287, 830258580, 1660517170, 3321034336 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..32.

FORMULA

a(n) = n * (1+ floor(sum{k=1 to n-1} a(k) /n)).

MATHEMATICA

f[l_List] := Block[{n = Length[l] + 1}, Append[l, n*(1 + Floor[Plus @@ l/n])]]; Nest[f, {}, 33] (*Chandler*)

CROSSREFS

Cf. A128021, A128022.

Sequence in context: A210633 A137829 A045925 * A116562 A140659 A238462

Adjacent sequences:  A128017 A128018 A128019 * A128021 A128022 A128023

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 | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified October 1 23:55 EDT 2014. Contains 247527 sequences.