The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 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

%I #12 Oct 10 2019 11:20:53

%S 1,1,2,3,8,15,24,42,72,117,190,308,504,819,1330,2160,3504,5678,9198,

%T 14877,24080,38976,63074,102051,165144,267200,432354,699570,1131928,

%U 1831524,2963460,4794987,7758464,12553464,20311940,32865420,53177364

%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 * ceiling[(a(n-1)+a(n-2))/n].

%t 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 *)

%Y Cf. A128034.

%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 May 30 16:58 EDT 2024. Contains 372971 sequences. (Running on oeis4.)