|
|
A002943
|
|
a(n) = 2*n*(2*n+1).
|
|
71
|
|
|
0, 6, 20, 42, 72, 110, 156, 210, 272, 342, 420, 506, 600, 702, 812, 930, 1056, 1190, 1332, 1482, 1640, 1806, 1980, 2162, 2352, 2550, 2756, 2970, 3192, 3422, 3660, 3906, 4160, 4422, 4692, 4970, 5256, 5550, 5852, 6162, 6480, 6806, 7140, 7482, 7832, 8190, 8556, 8930
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
a(n) is the number of edges in (n+1) X (n+1) square grid with all horizontal, vertical and diagonal segments filled in. - Asher Auel, Jan 12 2000
In other words, the edge count of the (n+1) X (n+1) king graph. - Eric W. Weisstein, Jun 20 2017
Write 0,1,2,... in clockwise spiral; sequence gives numbers on one of 4 diagonals. (See Example section.)
The identity (4*n+1)^2 - (4*n^2+2*n)*(2)^2 = 1 can be written as A016813(n)^2 - a(n)*2^2 = 1. - Vincenzo Librandi, Jul 20 2010 - Nov 25 2012
Starting with "6" = binomial transform of [6, 14, 8, 0, 0, 0, ...]. - Gary W. Adamson, Aug 27 2010
The hyper-Wiener index of the crown graph G(n) (n>=3). The crown graph G(n) is the graph with vertex set {x(1), x(2), ..., x(n), y(1), y(2), ..., y(n)} and edge set {(x(i), y(j)): 1 <= i,j <= n, i != j} (= the complete bipartite graph K(n,n) with horizontal edges removed). The Hosoya-Wiener polynomial of G(n) is n(n-1)(t+t^2)+nt^3. - Emeric Deutsch, Aug 29 2013
|
|
REFERENCES
|
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd ed., 1994, p. 99.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Edge Count.
Eric Weisstein's World of Mathematics, King Graph.
|
|
FORMULA
|
a(n) = 4*n^2 + 2*n.
Sum_{n>=1} 1/a(n) = 1-log(2). Sum_{n>=1} 1/a(n)^2 = 2*log(2) + Pi^2/6 - 3. - R. J. Mathar, Jan 15 2013
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi/4 + log(2)/2 - 1. - Amiram Eldar, Feb 22 2022
|
|
EXAMPLE
|
64--65--66--67--68--69--70--71--72
|
63 36--37--38--39--40--41--42
| | |
62 35 16--17--18--19--20 43
| | | | |
61 34 15 4---5---6 21 44
| | | | | | |
60 33 14 3 0 7 22 45
| | | | | | | |
59 32 13 2---1 8 23 46
| | | | | |
58 31 12--11--10---9 24 47
| | | |
57 30--29--28--27--26--25 48
| |
56--55--54--53--52--51--50--49
|
|
MAPLE
|
2*n*(2*n+1) ;
|
|
MATHEMATICA
|
LinearRecurrence[{3, -3, 1}, {0, 6, 20}, 40] (* Harvey P. Dale, Aug 11 2011 *)
|
|
PROG
|
(Haskell)
|
|
CROSSREFS
|
Sequences from spirals: A001107, A002939, A007742, A033951, A033952, A033953, A033954, A033989, A033990, A033991, A002943, A033996, A033988.
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|