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!)
A051746 a(n) = n(n+7)(n+1)(n^2+2n+12)/120. 1
2, 9, 27, 66, 141, 273, 490, 828, 1332, 2057, 3069, 4446, 6279, 8673, 11748, 15640, 20502, 26505, 33839, 42714, 53361, 66033, 81006, 98580, 119080, 142857, 170289, 201782, 237771, 278721, 325128, 377520, 436458, 502537, 576387, 658674, 750101 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000 (Corrected by Alois P. Heinz, Mar 14 2016)
FORMULA
a(n) = binomial(n+4, n-1)+binomial(n+1, n-1).
G.f.: x*(2-x)*(1-x+x^2)/(1-x)^6. - Colin Barker, Mar 19 2012
MATHEMATICA
Table[1/120*n*(n + 7)*(n + 1)*(n^2 + 2*n + 12), {n, 60}] (* Vladimir Joseph Stephan Orlovsky, Jun 14 2011 *)
LinearRecurrence[{6, -15, 20, -15, 6, -1}, {2, 9, 27, 66, 141, 273}, 40] (* Harvey P. Dale, Apr 28 2018 *)
PROG
(PARI) a(n)=((((n+10)*n+35)*n+110)*n+84)*n/120 \\ Charles R Greathouse IV, Jun 14 2011
(Magma) [1/120*n*(n+7)*(n+1)*(n^2+2*n+12): n in [1..50]]; // Vincenzo Librandi, Jun 15 2011
CROSSREFS
Sequence in context: A008910 A239059 A153977 * A277240 A256233 A123904
KEYWORD
easy,nonn
AUTHOR
Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Dec 07 1999
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 13:41 EDT 2024. Contains 371914 sequences. (Running on oeis4.)