|
| |
| |
|
|
|
0, 6, 16, 30, 48, 70, 96, 126, 160, 198, 240, 286, 336, 390, 448, 510, 576, 646, 720, 798, 880, 966, 1056, 1150, 1248, 1350, 1456, 1566, 1680, 1798, 1920, 2046, 2176, 2310, 2448, 2590, 2736, 2886, 3040, 3198, 3360, 3526, 3696, 3870, 4048, 4230, 4416
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
a(n) = number of edges in (n+1) X (n+1) square grid with all horizontal, vertical and great diagonal segments filled in.
Sequence allows us to find X values of the equation: 2*X^3 + 4*X^2 = Y^2. To find Y values: b(n)=2n(2*n^2 - 2). - Mohamed Bouhamida (bhmd95(AT)yahoo.fr), Nov 06 2007
|
|
|
LINKS
|
Table of n, a(n) for n=1..47.
|
|
|
FORMULA
|
a(n)=4*n+a(n-1)-2 (with a(1)=0) [From Vincenzo Librandi, Aug 06 2010]
a(1)=0, a(2)=6, a(3)=16, a(n)=3*a(n-1)-3*a(n-2)+a(n-3) [From Harvey P. Dale, Feb 03 2012]
|
|
|
EXAMPLE
|
For n=2, a(2)=4*2+0-2=6; n=3, a(3)=4*3+6-2=16; n=4, a(4)=4*4+16-2=30 [From Vincenzo Librandi, Aug 06 2010]
|
|
|
MAPLE
|
[ seq(2*n^2 - 2, n=1..60) ];
|
|
|
MATHEMATICA
|
s=0; lst={}; Do[s+=n+n-4; If[s>=0, AppendTo[lst, s]], {n, 1, 5!, 2}]; lst [From Vladimir Joseph Stephan Orlovsky, Nov 04 2008]
2*Range[50]^2-2 (* or *) LinearRecurrence[{3, -3, 1}, {0, 6, 16}, 50] (* From Harvey P. Dale, Feb 03 2012 *)
|
|
|
CROSSREFS
|
Cf. A046092, A002943.
a(n)=A100345(n+1, n-4) for n>2.
Cf. A005563, A067725.
Cf. A005563, A046092, A001082, A002378, A036666, A062717, A028347, A087475, A000217, A056220.
Sequence in context: A032422 A164052 A168472 * A113742 A102214 A115007
Adjacent sequences: A053997 A053998 A053999 * A054001 A054002 A054003
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Asher Auel (asher.auel(AT)reed.edu) Jan 12, 2000
|
|
|
STATUS
|
approved
|
| |
|
|
