Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,2

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

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] (*Chandler*)

CROSSREFS

Cf. A128020, A128023.

Sequence in context: A026698 A099428 A099920 this_sequence A011946 A166920 A080206

Adjacent sequences: A128019 A128020 A128021 this_sequence A128023 A128024 A128025

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Feb 11 2007

EXTENSIONS

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

page 1

Search completed in 0.003 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research