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!)
A128035 a(0)=a(1)=1. a(n) = the multiple of n which is >= a(n-1)+a(n-2) and is < a(n-1)+a(n-2)+n. 1
1, 1, 2, 3, 8, 15, 24, 42, 72, 117, 190, 308, 504, 819, 1330, 2160, 3504, 5678, 9198, 14877, 24080, 38976, 63074, 102051, 165144, 267200, 432354, 699570, 1131928, 1831524, 2963460, 4794987, 7758464, 12553464, 20311940, 32865420, 53177364 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = n * ceiling[(a(n-1)+a(n-2))/n].
MATHEMATICA
f[l_List] := Block[{n = Length[l]}, Append[l, n*(Ceiling[(l[[ -1]] + l[[ -2]])/n])]]; Nest[f, {1, 1}, 36] (* Ray Chandler, Feb 12 2007 *)
CROSSREFS
Cf. A128034.
Sequence in context: A174019 A356371 A293389 * A003473 A095373 A249357
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 06:12 EDT 2024. Contains 371769 sequences. (Running on oeis4.)