|
Search: id:A031358
|
|
|
| A031358 |
|
Number of coincidence site lattices of index 4n+1 in lattice Z^2. |
|
+0
1
|
|
| 1, 2, 0, 2, 2, 0, 2, 2, 0, 2, 2, 0, 0, 2, 0, 2, 4, 0, 2, 0, 0, 4, 2, 0, 2, 2, 0, 2, 2, 0, 0, 2, 0, 0, 2, 0, 4, 2, 0, 2, 0, 0, 2, 2, 0, 2, 4, 0, 2, 2, 0, 4, 0, 0, 0, 4, 0, 2, 2, 0, 2, 0, 0, 0, 2, 0, 4, 2, 0, 2, 2, 0, 2, 2, 0, 0, 4, 0, 2, 2, 0, 4, 0, 0, 2, 0, 0, 2, 2, 0, 0, 4, 0, 2, 4, 0, 0, 2, 0, 2, 2, 0, 2, 0, 0, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
M. Baake, "Solution of coincidence problem...", in R. V. Moody, ed., Math. of Long-Range Aperiodic Order, Kluwer 1997, pp. 9-44.
|
|
FORMULA
|
Dirichlet series: Product (1+p^(-s))/(1-p^(-s)); p == 1 (mod 4).
|
|
PROGRAM
|
(PARI) t1=direuler(p=2, 1200, (1+(p%4<2)*X))
t2=direuler(p=2, 1200, 1/(1-(p%4<2)*X))
t3=dirmul(t1, t2)
t4=vector(200, n, t3[4*n+1]) (and then prepend 1)
|
|
CROSSREFS
|
Sequence in context: A123530 A161516 A123063 this_sequence A029317 A127800 A035692
Adjacent sequences: A031355 A031356 A031357 this_sequence A031359 A031360 A031361
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from N. J. A. Sloane (njas(AT)research.att.com), Mar 13 2009
|
|
|
Search completed in 0.002 seconds
|
