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!)
A123198 a(n)=[(n+1)(2n-1)]^2. 1

%I #15 Mar 12 2014 16:37:00

%S 1,4,81,400,1225,2916,5929,10816,18225,28900,43681,63504,89401,122500,

%T 164025,215296,277729,352836,442225,547600,670761,813604,978121,

%U 1166400,1380625,1623076,1896129,2202256,2544025,2924100,3345241,3810304

%N a(n)=[(n+1)(2n-1)]^2.

%D Fredrick T. Wall, Chemical Thermodynamics, W. H, Freeman, San Francisco, 1965, page 269

%H Vincenzo Librandi, <a href="/A123198/b123198.txt">Table of n, a(n) for n = 0..10000</a>

%F a(n)=Sum((4k-1)(4k^2-2k-1),k=0..n) (n>=0).

%F G.f.: (1-x+71*x^2+25*x^3)/(1-x)^5. [Colin Barker, Jan 28 2012]

%p a:=n->(n+1)^2*(2*n-1)^2: seq(a(n),n=0..31);

%t f[m_] = Sum[(4*n - 1)*(4*n^2 - 2*n - 1), {n, 0, m}]; a = Table[f[n], {n, 0, 50}]

%K nonn

%O 0,2

%A _Roger L. Bagula_, Oct 04 2006

%E Edited by _N. J. A. Sloane_, Oct 15 2006

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 09:04 EDT 2024. Contains 375762 sequences. (Running on oeis4.)