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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128034 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, 4, 6, 12, 20, 36, 63, 104, 171, 280, 462, 744, 1209, 1960, 3180, 5152, 8347, 13500, 21850, 35360, 57225, 92598, 149845, 242448, 392300, 634764, 1027080, 1661856, 2688938, 4350810, 7039759, 11390592, 18430368, 29820992, 48251385, 78072408 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

a(n) = n * (1 +floor[(a(n-1)+a(n-2))/n]).

MATHEMATICA

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

CROSSREFS

Cf. A128035.

Sequence in context: A178547 A168674 A110935 * A027150 A020141 A049478

Adjacent sequences:  A128031 A128032 A128033 * A128035 A128036 A128037

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Feb 11 2007

EXTENSIONS

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 16 14:37 EST 2012. Contains 205930 sequences.