cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A364417 #26 Apr 25 2024 15:13:21
%S A364417 3,18,142,1266,12030,118650,1198230,12296202,127633590,1336133730,
%T A364417 14079114270,149124688482,1586159072814,16929780310218,
%U A364417 181227223899942,1944808008842490,20915277691567206
%N A364417 The number of stones-and-bones tilings of the (n,2n-3)-benzel.
%C A364417 See Problem 16 of the Propp article. It is conjectured that a(n) is 2-adically continuous as a function of n > 3.
%H A364417 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 A364417 Cf. A352207, A364416, A364418, A364438, A364481, A364482, A364483.
%K A364417 nonn,more
%O A364417 3,1
%A A364417 _James Propp_, Jul 23 2023
%E A364417 a(15)-a(19) from _James Propp_, Apr 25 2024