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 A353436 #7 Apr 26 2022 10:22:10 %S A353436 1,1,0,1,1,0,1,2,1,0,1,3,4,0,0,1,4,9,4,0,0,1,5,16,22,4,0,0,1,6,25,48, %T A353436 56,0,0,0,1,7,36,104,144,114,0,0,0,1,8,49,180,444,320,240,0,0,0,1,9, %U A353436 64,298,900,1566,720,376,0,0,0,1,10,81,468,1828,3744,5576,1312,584,0,0,0 %N A353436 Array read by descending antidiagonals: T(n,m) is the number of sequences of length n >= 0 with elements in 1..m-1 such that the determinant of the Hankel matrix of any odd number of consecutive terms is not divisible by m >= 1. %F A353436 T(n,m) = A353435(n,m) if m is prime. %F A353436 T(n,1) = 0 if n >= 1. %F A353436 T(n,2) = 0 if n >= 3. %F A353436 T(n,3) = 0 if n >= 5. %F A353436 T(n,4) = 0 if n >= 25. %F A353436 T(n,5) = 0 if n >= 23. %e A353436 Array begins: %e A353436 n\m| 1 2 3 4 5 6 7 8 9 %e A353436 ---+--------------------------------------------------- %e A353436 0 | 1 1 1 1 1 1 1 1 1 %e A353436 1 | 0 1 2 3 4 5 6 7 8 %e A353436 2 | 0 1 4 9 16 25 36 49 64 %e A353436 3 | 0 0 4 22 48 104 180 298 468 %e A353436 4 | 0 0 4 56 144 444 900 1828 3444 %e A353436 5 | 0 0 0 114 320 1566 3744 9812 23208 %e A353436 6 | 0 0 0 240 720 5576 15552 52784 157104 %e A353436 7 | 0 0 0 376 1312 16544 54216 249424 968616 %e A353436 8 | 0 0 0 584 2400 49900 189468 1191264 5991624 %e A353436 9 | 0 0 0 724 3232 124052 550728 4955824 33844176 %e A353436 10 | 0 0 0 920 4560 314932 1604088 20623232 191898648 %Y A353436 Cf. A353434, A353435. %Y A353436 Rows: A000012 (n=0), A001477 (n=1), A000290 (n=2). %Y A353436 Columns: A000007 (m=1), A130716 (m=2). %K A353436 nonn,tabl %O A353436 0,8 %A A353436 _Pontus von Brömssen_, Apr 21 2022