The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066864 Number of binary arrangements without adjacent 1's on n X n rhombic hexagonal grid. 18

%I

%S 1,2,6,42,524,13322,647252,61758332,11435477118,4129523869606,

%T 2902264461628298,3973109800760143708,10590895512774862686570,

%U 54979738656662942307796576,555797909644630436677137498230,10941698340065066230952215658836402,419471520990343359533179780148504998680

%N Number of binary arrangements without adjacent 1's on n X n rhombic hexagonal grid.

%C Also the number of tilings of an (n+1) X (n+1) square using 1 X 1 squares and L-tiles. An L-tile is a 2 X 2 square with the upper right 1 X 1 subsquare removed and no rotations are allowed. a(2) = 6:

%C ._____ _____ _____ _____ _____ _____

%C |_|_|_| | |_|_| |_|_|_| |_| |_| |_|_|_| |_| |_|

%C |_|_|_| |___|_| | |_|_| |_|___| |_| |_| | |___|

%C |_|_|_| |_|_|_| |___|_| |_|_|_| |_|___| |___|_|. - _Alois P. Heinz_, Jun 06 2013

%D Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 342-349.

%D 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.

%H Vaclav Kotesovec and Alois P. Heinz, <a href="/A066864/b066864.txt">Table of n, a(n) for n = 0..28</a>

%H Steven R. Finch, <a href="http://www.people.fas.harvard.edu/~sfinch/constant/square/square.html">Hard Square Entropy Constant</a> [Broken link]

%H Steven R. Finch, <a href="http://web.archive.org/web/20010605012506/http://www.mathsoft.com/asolve/constant/square/square.html">Hard Square Entropy Constant</a> [From the Wayback machine]

%H V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>, 6ed, 2013, p. 69-71.

%F Lim_{n->infinity} a(n)^(1/n^2) = 1.395485972... (see A085851).

%e Neighbors for n=4:

%e o--o--o--o

%e | /| /| /|

%e |/ |/ |/ |

%e o--o--o--o

%e | /| /| /|

%e |/ |/ |/ |

%e o--o--o--o

%e | /| /| /|

%e |/ |/ |/ |

%e o--o--o--o

%p a:= proc(n) option remember; local b; b:=

%p proc(n, l) option remember; local k;

%p if n<2 then 1

%p elif min(l[])>0 then b(n-1, map(h->h-1, l))

%p else for k while l[k]>0 do od; b(n, subsop(k=1, l))+

%p `if`(n>1 and k<nops(l) and l[k+1]=0,

%p b(n, subsop(k=2, k+1=1, l)), 0)

%p fi

%p end: forget(b);

%p b(n+1, [0\$n+1])

%p end:

%p seq(a(n), n=0..15); # _Alois P. Heinz_, Aug 26 2013

%t \$RecursionLimit = 1000; a[n0_] := a[n0] = Module[{b}, b[n_, l_List] := b[n, l] = Module[{k}, Which[n<2, 1, Min[l]>0, b[n-1, l-1], True, For[k = 1, l[[k]] > 0, k++]; b[n, ReplacePart[l, k -> 1]] + If[n>1 && k<Length[l] && l[[k+1]] == 0, b[n, ReplacePart[l, {k -> 2, k+1 -> 1}]], 0]]]; b[n0+1, Array[0&, n0+1]]]; Table[a[n], {n, 0, 15}] (* _Jean-François Alcover_, Feb 24 2015, after _Alois P. Heinz_ *)

%o [S/R] proc a

%o stvar \$[N][N]:boolean

%o init \$[][] := false

%o cyset true

%o asgn \$[][]->{false,true}

%o kill +[i in 0.. N-1](

%o +[j in 0.. N-1](

%o \$[i][j]`*(

%o (\$[i][j+1]`?(j<=N-2)|false)

%o +(\$[i-1][j+1]`?((i>0)*(j<=N-2))|false)

%o +(\$[i-1][j]`?(i>0)|false) ))) end

%Y Cf. A006506, A027683, A066863, A066865, A066866.

%Y Main diagonal of A219741 and A226444.

%K nonn,nice,hard

%O 0,2

%A _R. H. Hardin_, Jan 25 2002

%E a(12)-a(21) from _Vaclav Kotesovec_, May 01 2012

%E a(0) and a(22) from _Alois P. Heinz_, Aug 26 2013

%E a(23) from _Alois P. Heinz_, Aug 28 2013

%E a(24) from _Vaclav Kotesovec_, Sep 19 2014

%E a(25) from _Alois P. Heinz_, Dec 03 2014

%E a(26)-a(28) from _Vaclav Kotesovec_, Aug 13 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 29 21:32 EDT 2020. Contains 333117 sequences. (Running on oeis4.)