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!)
A058920 a(n) = 2n^4 + 2n^3 + 3n^2 + 2n + 1. 1
1, 10, 65, 250, 697, 1586, 3145, 5650, 9425, 14842, 22321, 32330, 45385, 62050, 82937, 108706, 140065, 177770, 222625, 275482, 337241, 408850, 491305, 585650, 692977, 814426, 951185, 1104490, 1275625, 1465922, 1676761, 1909570, 2165825 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
On a 2n X (n^2 - n + 1) X n^2 cuboid (with n >= 3) there are six pairs of points with the maximum surface distance between them: the four pairs of opposite corners and the opposite pairs of points on the smallest faces 1 in from the midpoints of the shortest edges; this maximum surface distance is sqrt(a(n)).
LINKS
FORMULA
G.f.: (1+5*x+25*x^2+15*x^3+2*x^4)/(1-5*x+10*x^2-10*x^3+5*x^4-x^5). - Colin Barker, Jan 01 2012
MATHEMATICA
Table[2n^4+2n^3+3n^2+2n+1, {n, 0, 40}] (* or *) LinearRecurrence[{5, -10, 10, -5, 1}, {1, 10, 65, 250, 697}, 40] (* Harvey P. Dale, Dec 17 2017 *)
PROG
(PARI) for (n = 0, 500, write("b058920.txt", n, " ", 2*n^4 + 2*n^3 + 3*n^2 + 2*n + 1); ) \\ Harry J. Smith, Jun 24 2009
CROSSREFS
For n >= 2 the sequence is a subsequence of A007692.
Sequence in context: A229996 A255245 A210369 * A263472 A250287 A059598
KEYWORD
nonn,easy
AUTHOR
Henry Bottomley, Jan 11 2001
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 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)