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!)
A022036 Define the sequence T(a_0,a_1) by a_{n+2} is the greatest integer such that a_{n+2}/a_{n+1}<a_{n+1}/a_n for n >= 0. This is T(7,43). 1

%I #20 Feb 14 2016 08:24:36

%S 7,43,264,1620,9940,60989,374211,2296051,14087908,86439348,530366956,

%T 3254178965,19966705347,122509956183,751685824132,4612127828672,

%U 28298688661016,173632607265289,1065359694467895,6536740399587511,40107557356899000,246088426157852600,1509927741297161799

%N Define the sequence T(a_0,a_1) by a_{n+2} is the greatest integer such that a_{n+2}/a_{n+1}<a_{n+1}/a_n for n >= 0. This is T(7,43).

%H Robert Israel, <a href="/A022036/b022036.txt">Table of n, a(n) for n = 0..1200</a>

%p a[0]:= 7: a[1]:= 43:

%p for i from 2 to 100 do

%p a[i]:= ceil(a[i-1]^2/a[i-2] - 1)

%p od:

%p seq(a[i],i=0..100); # _Robert Israel_, Sep 18 2015

%t a = {7, 43}; Do[AppendTo[a, Floor[a[[n]]^2/a[[n - 1]]]], {n, 2, 22}];

%t a (* _Michael De Vlieger_, Sep 18 2015 *)

%o (PARI) T(a0, a1, maxn) = a=vector(maxn); a[1]=a0; a[2]=a1; for(n=3, maxn, a[n]=ceil(a[n-1]^2/a[n-2])-1); a

%o T(7, 43, 30) \\ _Colin Barker_, Feb 14 2016

%K nonn

%O 0,1

%A _R. K. Guy_

%E a(19)-a(22) from _Michael De Vlieger_, Sep 18 2015

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 July 29 12:20 EDT 2024. Contains 374734 sequences. (Running on oeis4.)