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.

A293960 Number A(n,k) of linear chord diagrams having n chords and no chord length larger than k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

This page as a plain text file.
%I A293960 #16 Oct 18 2018 15:56:31
%S A293960 1,1,0,1,1,0,1,1,1,0,1,1,3,1,0,1,1,3,5,1,0,1,1,3,15,11,1,0,1,1,3,15,
%T A293960 35,21,1,0,1,1,3,15,105,103,43,1,0,1,1,3,15,105,315,343,85,1,0,1,1,3,
%U A293960 15,105,945,1141,979,171,1,0,1,1,3,15,105,945,3465,4779,2915,341,1,0
%N A293960 Number A(n,k) of linear chord diagrams having n chords and no chord length larger than k; square array A(n,k), n>=0, k>=0, read by antidiagonals.
%C A293960 All terms in columns k > 0 are odd.
%H A293960 Alois P. Heinz, <a href="/A293960/b293960.txt">Antidiagonals n = 0..40, flattened</a>
%F A293960 A(n,k) = Sum_{j=0..k} A293961(n,j).
%F A293960 A(n,k) = A(n,n) = A001147(n) for k >= n.
%e A293960 Square array A(n,k) begins:
%e A293960   1, 1,  1,   1,    1,     1,     1,      1, ...
%e A293960   0, 1,  1,   1,    1,     1,     1,      1, ...
%e A293960   0, 1,  3,   3,    3,     3,     3,      3, ...
%e A293960   0, 1,  5,  15,   15,    15,    15,     15, ...
%e A293960   0, 1, 11,  35,  105,   105,   105,    105, ...
%e A293960   0, 1, 21, 103,  315,   945,   945,    945, ...
%e A293960   0, 1, 43, 343, 1141,  3465, 10395,  10395, ...
%e A293960   0, 1, 85, 979, 4779, 14857, 45045, 135135, ...
%Y A293960 Columns k=0-10 give: A000007, A000012, A001045(n+1), A293995, A293996, A293997, A293998, A293999, A294000, A294001, A294002.
%Y A293960 Main diagonal gives A001147.
%Y A293960 Cf. A293961.
%K A293960 nonn,tabl
%O A293960 0,13
%A A293960 _Alois P. Heinz_, Oct 20 2017