login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071233 2*(n-1)*(n^2+1). 1
0, 10, 40, 102, 208, 370, 600, 910, 1312, 1818, 2440, 3190, 4080, 5122, 6328, 7710, 9280, 11050, 13032, 15238, 17680, 20370, 23320, 26542, 30048, 33850, 37960, 42390, 47152, 52258, 57720, 63550, 69760, 76362, 83368, 90790, 98640, 106930, 115672, 124878, 134560 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

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

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..2000

FORMULA

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

PROG

(MAGMA) [2*(n-1)*(n^2+1): n in [1..50]]; // Vincenzo Librandi, Jun 14 2011

CROSSREFS

Sequence in context: A060317 A033583 A131037 * A063490 A002419 A199826

Adjacent sequences:  A071230 A071231 A071232 * A071234 A071235 A071236

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Jun 11 2002

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified July 31 13:50 EDT 2014. Contains 245085 sequences.