A247415 -id:A247415 - cp's OEIS frontend

A247416 Number of friezes of type B_n.

2, 6, 21, 75, 273, 1008, 3762, 14158, 53635, 204270, 781378, 2999906, 11553234, 44612760, 172671925, 669679793, 2601913466, 10125418060, 39459828905, 153977743500, 601545298200, 2352559491900, 9209476821105, 36084150102001, 141499349638556, 555292275455022, 2180689496523468, 8569380062230708

Offset: 1

Bruce Fontaine, Sep 16 2014

nonn

B. Fontaine and P.-G. Plamondon, Counting friezes in type D_n, arXiv:1409.3698 [math.CO], 2014.

Cf. A000108, A000984 and A247415, the number of friezes of type A_n, C_n and D_n.

a(n) = sum(m=1,sqrtint(n+1), binomial(2*n-m^2+1,n) ); \\ Joerg Arndt, Sep 16 2014

a(n) = sum_{m=1..floor(sqrt(n+1))} binomial(2n-m^2+1,n).

A111340 Number of positive integer 2-friezes with n-1 nontrivial rows.

Original entry on oeis.org

1, 5, 51, 868, 26952

Offset: 1

N. J. A. Sloane, based on correspondence from James Propp, May 08 2005

The n-th term is the number of positive integer tables a(i,m) (with i running from 1 to n+3 and m running from minus infinity to infinity) subject to the boundary conditions a(i,m) = 0 when i = 1 or i = n+3 and a(i,m) = 1 when i = 2 or i = n+2 and the internal condition a(i,m-1) a(i,m+1) = a(i-1,m) a(i+1,m) + a(i,m) when i is strictly between 2 and n+2.
It is not known as of this writing whether any or all of the terms of the sequence beyond 868 are finite. If the final term "a(i,n)" in the internal condition is replaced by "1", then what we are looking is just a frieze pattern a la Conway and Coxeter (or rather two interlaced frieze patterns that do not interact at all).
According to the lecture notes by S. Morier-Genoud (see paragraph "2-frieze of positive integers"), a(5) is conjectured to be 26952, and it is proved that there are no more finite terms. - Andrei Zabolotskii, Nov 01 2022

			The number 1 in the sequence is counting the rather boring configuration
    0 0 0 0 0 0 0 0
... 1 1 1 1 1 1 1 1 ...
    1 1 1 1 1 1 1 1
    0 0 0 0 0 0 0 0
The number 5 is counting the configuration
    0 0 0 0 0 0 0 0 0 0
    1 1 1 1 1 1 1 1 1 1
... 1 1 2 3 2 1 1 2 3 2 ...
    1 1 1 1 1 1 1 1 1 1
    0 0 0 0 0 0 0 0 0 0
and its four distinct cyclic shifts, each of which repeats with period 5 (note the Lyness 5-cycle A076839 in the middle).
a(2) = A000108(3) = number of friezes of type A_2 (cyclic shifts of A139434), a(3) = A247415(4). a(4) and a(5) also count friezes of types resp. E_6 and E_8.

Sophie Morier-Genoud, Lecture notes on Integrable Systems and Friezes, 2017.
Robin Zhang, A positive Siegel theorem: Dynkin friezes and positive Mordell-Schinzel, arXiv:2503.08800 [math.NT], 2025.

Cf. A000108, A247415, A076839, A139434.

The last finite term, a(5), added based on Zhang's preprint and name clarified by Andrei Zabolotskii, May 14 2025

cp's OEIS Frontend

A247416 Number of friezes of type B_n.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A111340 Number of positive integer 2-friezes with n-1 nontrivial rows.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions