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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071233 a(n) = 2*(n-1)*(n^2 + 1). 1

%I

%S 0,10,40,102,208,370,600,910,1312,1818,2440,3190,4080,5122,6328,7710,

%T 9280,11050,13032,15238,17680,20370,23320,26542,30048,33850,37960,

%U 42390,47152,52258,57720,63550,69760,76362,83368,90790,98640,106930,115672,124878,134560

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

%D T. A. Gulliver, Sequences from Arrays of Integers, Int. Math. Journal, Vol. 1, No. 4, pp. 323-332, 2002.

%H Vincenzo Librandi, <a href="/A071233/b071233.txt">Table of n, a(n) for n = 1..2000</a>

%F a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4).

%o (MAGMA) [2*(n-1)*(n^2+1): n in [1..50]]; // _Vincenzo Librandi_, Jun 14 2011

%K nonn,easy

%O 1,2

%A _N. J. A. Sloane_, Jun 11 2002

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 14 12:11 EDT 2021. Contains 342949 sequences. (Running on oeis4.)