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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A027089 a(n) = A027082(n, 2n-2). 0
 1, 5, 14, 39, 108, 299, 828, 2299, 6401, 17875, 50062, 140601, 395933, 1117737, 3162812, 8969267, 25487555, 72565339, 206969662, 591304797, 1691991626, 4848703909, 13914119144, 39980978277, 115023510495, 331303274449 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 LINKS Table of n, a(n) for n=2..27. FORMULA Conjecture: D-finite with recurrence -(n+2)*(244*n-1065)*a(n) +3*(n+1)*(422*n -1703)*a(n-1) +2*(-359*n^2 +1211*n -1420)*a(n-2) +2*(-1174*n^2 +6319*n -7410)*a(n-3) +(-760*n^2 +2173*n +1616)*a(n-4) +(-502*n^2 +2245*n -1123)*a(n-5) +6*(23*n-67) *(n-5)*a(n-6)=0. - R. J. Mathar, Jun 24 2020 CROSSREFS Cf. A027082. Sequence in context: A024525 A209536 A119996 * A184437 A023871 A274598 Adjacent sequences: A027086 A027087 A027088 * A027090 A027091 A027092 KEYWORD nonn AUTHOR Clark Kimberling 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.

Last modified December 4 05:36 EST 2023. Contains 367541 sequences. (Running on oeis4.)