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!)
A022030 For even n, a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n); for odd n, the least integer such that a(n+2)/a(n+1) > a(n+1)/a(n); a(0) = 4, a(1) = 16. 1
4, 16, 63, 249, 984, 3889, 15370, 60745, 240075, 948819, 3749901, 14820274, 58572352, 231488326, 914882931, 3615779646, 14290202610, 56477415835, 223208766625, 882160643536, 3486455360919, 13779090092886, 54457408494633, 215225339261149, 850608722312629, 3361756570848769 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Original definition: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n).
This original definition would lead to sequence 4, 16, 63, 248, 976, 3841, ... which agrees to over 2000 terms with the conjectured g.f. = (4 - x^2)/(1 - 4*x + x^3). - M. F. Hasler, Feb 11 2016
LINKS
FORMULA
Conjecture: a(n) = 4*a(n-1)-a(n-3)+a(n-4). G.f. = (4-x^2+x^3)/(1-4*x+x^3-x^4). - Colin Barker, Feb 16 2012
a(n) = ceiling(a(n-1)^2/a(n-2))-1 for even n > 0, a(n) = floor(a(n-1)^2/a(n-2))+1 for even n > 0. - M. F. Hasler, Feb 11 2016
PROG
(PARI) a=[4, 16]; for(n=2, 2000, a=concat(a, if(bittest(n, 0), a[n]^2\a[n-1]+1, ceil(a[n]^2/a[n-1])-1))); A022030(n)=a[n+1] \\ M. F. Hasler, Feb 11 2016
CROSSREFS
Sequence in context: A099503 A119376 A282310 * A135450 A265032 A162547
KEYWORD
nonn
AUTHOR
EXTENSIONS
Edited (definition changed to fit data, extended to 3 lines) by M. F. Hasler, Feb 11 2016
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 September 9 20:10 EDT 2024. Contains 375765 sequences. (Running on oeis4.)