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!)
A022037 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,50). 1
7, 50, 357, 2548, 18185, 129785, 926265, 6610678, 47179871, 336718900, 2403135388, 17150981703, 122405160710, 873595670959, 6234781212586, 44497126143199, 317572368218278, 2266488148722385, 16175741476249015, 115444950574278036, 823921217624950245 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
This coincides with the Pisot T(7,50) sequence as defined in A008776 at least up to n <= 14000. - R. J. Mathar, Feb 13 2016
LINKS
FORMULA
Empirical g.f.: (7+x-x^3-x^4-x^5-x^6) / (1-7*x-x^2+x^4+x^5+x^6+x^7). - Colin Barker, Dec 02 2014
PROG
(PARI) T(a0, a1, maxn) = a=vector(maxn); a[1]=a0; a[2]=a1; for(n=3, maxn, a[n]=floor(a[n-1]^2/a[n-2])); a;
T(7, 50, 30) \\ Colin Barker, Feb 14 2016
CROSSREFS
Sequence in context: A033117 A096882 A033125 * A054413 A163458 A081571
KEYWORD
nonn
AUTHOR
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 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)