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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064202 a(n) = n*(n+1)*(n+2)*(2*n^3 + 6*n^2 + 7*n - 3)/36. 1

%I

%S 0,2,34,210,830,2520,6412,14364,29220,55110,97790,165022,266994,

%T 416780,630840,929560,1337832,1885674,2608890,3549770,4757830,6290592,

%U 8214404,10605300,13549900,17146350,21505302,26750934,33022010

%N a(n) = n*(n+1)*(n+2)*(2*n^3 + 6*n^2 + 7*n - 3)/36.

%D L. Berzolari, Allgemeine Theorie der Höheren Ebenen Algebraischen Kurven, Encyclopädie der Mathematischen Wissenschaften mit Einschluss ihrer Anwendungen. Band III_2. Heft 3, Leipzig: B. G. Teubner, 1906. p. 352.

%H Vincenzo Librandi, <a href="/A064202/b064202.txt">Table of n, a(n) for n = 0..1000</a>

%F G.f.: 2*x*(1+10*x+7*x^2+2*x^3)/(1-x)^7. - _Colin Barker_, Feb 28 2012

%t Table[n*(n+1)*(n+2)*(2*n^3+6*n^2+7*n-3)/36,{n,0,40}] (* _Vincenzo Librandi_, Feb 29 2012 *)

%o (Magma) [n*(n+1)*(n+2)*(2*n^3 + 6*n^2 + 7*n -3)/36: n in [0..30]]; // _Vincenzo Librandi_, Feb 29 2012

%K nonn,easy

%O 0,2

%A Antreas P. Hatzipolakis (xpolakis(AT)otenet.gr), Sep 22 2001

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 November 30 21:57 EST 2022. Contains 358453 sequences. (Running on oeis4.)