|
Search: id:A066865
|
|
|
| A066865 |
|
Number of binary arrangements without adjacent 1's on n X n staggered hexagonal torus bent for odd n. |
|
+0
5
|
|
| 1, 5, 22, 217, 4726, 164258, 14840533, 1834600977, 669877863205, 296979228487760, 434542100979981567
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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
|
|
EXAMPLE
|
Neighbors for n=4: (The dots here represent spaces)
\|/ | \|/ |
-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
/| /|\ | /|\ |\
|
|
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) 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
|
Cf. A006506 A027683 A066863 A066864 A066866, shifted instead of bent A067967.
Row sums of A067015.
Sequence in context: A048252 A066866 A115657 this_sequence A005632 A002069 A120488
Adjacent sequences: A066862 A066863 A066864 this_sequence A066866 A066867 A066868
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ron Hardin (rhhardin(AT)att.net), Jan 25, 2002
|
|
|
Search completed in 0.002 seconds
|
