The OEIS is supported by the many generous donors to the OEIS Foundation.

 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

%I #9 Oct 10 2019 11:21:12

%S 1,1,4,6,12,20,36,63,104,171,280,462,744,1209,1960,3180,5152,8347,

%T 13500,21850,35360,57225,92598,149845,242448,392300,634764,1027080,

%U 1661856,2688938,4350810,7039759,11390592,18430368,29820992,48251385,78072408

%N 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.

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

%t f[l_List] := Block[{n = Length[l]},Append[l, n*(1 + Floor[(l[[ -1]] + l[[ -2]])/n])]];Nest[f, {1, 1}, 36] (* _Ray Chandler_, Feb 12 2007 *)

%Y Cf. A128035.

%K easy,nonn

%O 0,3

%A _Leroy Quet_, Feb 11 2007

%E Extended by _Ray Chandler_, Feb 12 2007

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.

Last modified April 16 05:35 EDT 2024. Contains 371697 sequences. (Running on oeis4.)