The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A176621 a(n) = 2 + Sum_{k=0..n-1} A176513(4*k+1). 1
 2, 3, 4, 11, 40, 157, 656, 2721, 11346, 47337, 197398, 823471, 3434718, 14326815, 59760224, 249271079, 1039759044, 4337038713, 18090636780, 75459593981, 314756746798, 1312912064069, 5476413466674, 22843193551799, 95283436047290 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Old name was "a(n) is the minimum number that can be expressed as the sum of n terms of sequence A176513". Lim_{n -> infinity} a(n+1)/a(n) = s^4 = 4.17119593178..., where s is the root of the characteristic equation s^5 = s^3 + s^2 + 1. LINKS Index entries for linear recurrences with constant coefficients, signature (3, 5, 2, -11, 3, -1). FORMULA From Jianing Song, Feb 04 2019: (Start) a(n+5) = 2*a(n+4) + 7*a(n+3) + 9*a(n+2) - 2*a(n+1) + a(n) - 32. a(n+6) = 3*a(n+5) + 5*a(n+4) + 2*a(n+3) - 11*a(n+2) + 3*a(n+1) - a(n). (End) PROG (PARI) a(n) = my(v=vector(n+1), u=[2, 3, 4, 11, 40]); for(k=1, n+1, v[k]=if(k<=5, u[k], 2*v[k-1] + 7*v[k-2] + 9*v[k-3] - 2*v[k-4] + v[k-5] - 32)); v[n+1] \\ Jianing Song, Feb 04 2019 CROSSREFS Cf. A176513. Sequence in context: A221172 A116054 A339782 * A099527 A096864 A013620 Adjacent sequences:  A176618 A176619 A176620 * A176622 A176623 A176624 KEYWORD nonn,easy AUTHOR Carmine Suriano, Apr 22 2010 EXTENSIONS New name, a(0) = 2 prepended and a(1), a(2) corrected by Jianing Song, Feb 04 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 20 18:45 EDT 2021. Contains 343137 sequences. (Running on oeis4.)