|
Search: id:A053479
|
|
|
| A053479 |
|
Circle numbers (version 6): a(n)= number of points (i+j/2,j*sqrt(3)/2), i,j integers (triangular grid) contained in a circle of diameter n, centered at (1/2, 1/(2*sqrt(3))). |
|
+0
6
|
|
| 0, 0, 3, 6, 12, 21, 30, 42, 54, 69, 90, 102, 129, 150, 174, 198, 225, 258, 288, 327, 354, 396, 435, 471, 522, 558, 609, 654, 702, 759, 807, 864, 924, 981, 1038, 1104, 1173, 1230, 1308, 1368, 1443, 1512, 1590, 1671, 1746, 1830, 1908, 2001, 2076, 2166, 2265
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
In other words, number of points in a hexagonal lattice covered by a circular disk of diameter n if the center of the circle is chosen at the deep hole. - Hugo Pfoertner (hugo(AT)pfoertner.org), Jan 07 2007
Also number of integer coordinate pairs (s,t) satisfying s^2+t^2+st-s-t <= n^2/4-1/3. The a(2)=3 coordinate pairs are (s,t)=(0,0), (0,1) and (1,0). The a(3)=6 coordinate pairs are (-1,1),(0,0),(0,1),(1,-1),(1,0) and (1,1). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 23 2007
|
|
LINKS
|
H. v. Eitzen, Table of n, a(n) for n=0..1000
Index entries for sequences related to A2 = hexagonal = triangular lattice
|
|
FORMULA
|
a(n)/(n/2)^2->Pi*2/sqrt(3)
|
|
MAPLE
|
A053479 := proc(n) local res, a, b ; res :=0 ; for a from -n to n do for b from -n to n do if a^2+b^2+a*b-a-b <= n^2/4-1/3 then res := res+1 ; fi ; od ; od ; RETURN(res) ; end : for n from 1 to 40 do printf("%d ", A053479(n)) ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 23 2007
|
|
CROSSREFS
|
Cf. A053411, A053414, A053415, A053416, A053417.
Cf. A005882, A125850, A125851, A125852.
Sequence in context: A028924 A034738 A054064 this_sequence A070333 A011779 A161809
Adjacent sequences: A053476 A053477 A053478 this_sequence A053480 A053481 A053482
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Jan 14 2000
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com), Jul 03 2008 at the suggestion of R. J. Mathar
|
|
|
Search completed in 0.002 seconds
|
