A111340 Number of positive integer 2-friezes with n-1 nontrivial rows.
1, 5, 51, 868, 26952
Offset: 1
Examples
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.
Links
- 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.
Extensions
The last finite term, a(5), added based on Zhang's preprint and name clarified by Andrei Zabolotskii, May 14 2025
Comments