|
Search: id:A066863
|
|
|
| A066863 |
|
Number of binary arrangements without adjacent 1's on n X n staggered hexagonal grid. |
|
+0
4
|
|
| 2, 6, 43, 557, 14432, 719469, 70372090, 13351521479, 4941545691252, 3559349503024593, 4993739972681894885, 13642580224488264353504
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 342-349.
J. Katzenelson and R. P. Kurshan, S/R: A Language for Specifying Protocols and Other Coordinating Processes, pp. 286-292 in Proc. IEEE Conf. Comput. Comm., 1986.
|
|
LINKS
|
S. R. Finch, Hard Square Entropy Constant
Eric Weisstein's World of Mathematics, Hard Hexagon Entropy Constant
|
|
EXAMPLE
|
Neighbors for n=4:
o--o--o--o
| /|\ | /|
|/ | \|/ |
o--o--o--o
| /|\ | /|
|/ | \|/ |
o--o--o--o
| /|\ | /|
|/ | \|/ |
o--o--o--o
|
|
PROGRAM
|
[S/R] proc a
stvar $[N][N]:boolean
init $[][] := false
cyset true
asgn $[][]->{false, true}
kill +[i in 0.. N-1](
+[j in 0.. N-1](
$[i][j]`*(
($[i][j+1]`?(j<=N-2)|false)
+($[i-1][j-1]`?((i>0)*(j>0)*((j mod 2)=0))|false)
+($[i-1][j+1]`?((i>0)*(j<=N-2)*((j mod 2)=0))|false)
+($[i-1][j]`?(i>0)|false)))) end
|
|
CROSSREFS
|
Cf. A006506 A027683 A066864-A066866.
Adjacent sequences: A066860 A066861 A066862 this_sequence A066864 A066865 A066866
Sequence in context: A000610 A023363 A091241 this_sequence A135815 A055564 A077259
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ron Hardin (rhh(AT)cadence.com), Jan 25, 2002
|
|
|
Search completed in 0.002 seconds
|
