Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128020
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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)). +0
3
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; listen)
OFFSET

1,2

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: A034882 A137829 A045925 this_sequence A116562 A099495 A034875

Adjacent sequences: A128017 A128018 A128019 this_sequence A128021 A128022 A128023

KEYWORD

easy,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Feb 11 2007

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Feb 12 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research