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.
%I A381552 #13 Mar 06 2025 10:55:01 %S A381552 3,4,4,5,12,4,6,25,20,4,7,44,61,28,4,8,70,146,113,36,4,9,104,301,344, %T A381552 181,44,4,10,147,560,876,670,265,52,4,11,200,966,1968,2035,1156,365, %U A381552 60,4,12,264,1572,4026,5368,4082,1834,481,68,4,13,340,2442,7656,12727,12376,7385,2736,613,76,4,14,429,3652,13728,27742,33397,25312,12376,3894,761,84,4 %N A381552 Triangle read by rows T(n,k) is the number of diamond coverings for a specific number of diamonds covering an odd length row of triangles. %C A381552 The total number of ways the diamond can cover a single row of length(n) triangles is the Fibonacci series. This total can be subdivided into categories based on the number of covering diamonds. The number of categories increase with the length of the row providing the structure of the triangle (see illustrations in the link below). %C A381552 A381555 provides additional graphics explaining the diamond coverings. %H A381552 Craig Knecht, <a href="/A381552/a381552.png">Splitting the Fibonacci numbers</a>. %H A381552 Craig Knecht, <a href="/A381552/a381552_1.png">Fibonacci Expansion</a>. %e A381552 Triangle begins: %e A381552 3; %e A381552 4, 4; %e A381552 5, 12, 4; %e A381552 6, 25, 20, 4; %e A381552 7, 44, 61, 28, 4; %e A381552 8, 70, 146, 113, 36, 4; %e A381552 ... %Y A381552 Cf. A000297, A080856, A381555. %K A381552 nonn,tabl %O A381552 0,1 %A A381552 _Craig Knecht_, Feb 27 2025