|
| |
|
|
A066865
|
|
Number of binary arrangements without adjacent 1's on n X n staggered hexagonal torus bent for odd n.
|
|
5
|
|
|
|
1, 5, 22, 217, 4726, 164258, 14840533, 1834600977, 669877863205, 296979228487760, 434542100979981567, 692625866382651263578, 4053364289624915167879497, 23237986479606982160703729647, 543749373021017146939376423644362, 11213018647250714014261414954480048385
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Steven 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
|
|
|
|
EXAMPLE
|
Neighbors for n=4:
\|/ | \|/ |
-o--o--o--o-
| /|\ | /|\
\|/ | \|/ |
-o--o--o--o-
| /|\ | /|\
\|/ | \|/ |
-o--o--o--o-
| /|\ | /|\
\|/ | \|/ |
-o--o--o--o-
| /|\ | /|\
Neighbors for n=5:
\|/ | \|/ | \|/
o--o--o--o--o
/| /|\ | /|\ |\
\|/ | \|/ | \|/
o--o--o--o--o
/| /|\ | /|\ |\
\|/ | \|/ | \|/
o--o--o--o--o
/| /|\ | /|\ |\
\|/ | \|/ | \|/
o--o--o--o--o
/| /|\ | /|\ |\
\|/ | \|/ | \|/
o--o--o--o--o
/| /|\ | /|\ |\
|
|
|
PROG
|
(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) mod N]`
+$[(i-1) mod N][j]`
+(
$[(i-1) mod N][(j-1) mod N]`
? ((j mod 2)=0) |
$[(i+1) mod N][(j-1) mod N]`
)
) ? ((j>0)+((N mod 2)=0)) | (
$[(i-1) mod N][j]`
+$[(i-1) mod N][(j-1) mod N]`
+$[(i+1) mod N][(j-1) mod N]` )))) end
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
