login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

The number of stones-and-bones tilings of the (n,2n-3)-benzel.
6

%I #26 Apr 25 2024 15:13:21

%S 3,18,142,1266,12030,118650,1198230,12296202,127633590,1336133730,

%T 14079114270,149124688482,1586159072814,16929780310218,

%U 181227223899942,1944808008842490,20915277691567206

%N The number of stones-and-bones tilings of the (n,2n-3)-benzel.

%C See Problem 16 of the Propp article. It is conjectured that a(n) is 2-adically continuous as a function of n > 3.

%H James Propp, <a href="https://arxiv.org/abs/2206.06472">Trimer covers in the triangular grid: twenty mostly open problems</a>, arXiv:2206.06472 [math.CO], 2022.

%Y Cf. A352207, A364416, A364418, A364438, A364481, A364482, A364483.

%K nonn,more

%O 3,1

%A _James Propp_, Jul 23 2023

%E a(15)-a(19) from _James Propp_, Apr 25 2024