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.

A136868 Table read by antidiagonals: T(n,k) is the number of connected directed multigraphs with loops with n arcs and k vertices, which are transitive (the existence of a path between two points implies the existence of an arc between those two points).

This page as a plain text file.
%I A136868 #2 Mar 31 2012 10:31:22
%S A136868 1,1,0,1,1,0,1,2,1,0,1,2,4,1,0,1,2,6,7,1,0,1,2,6,14,12,1,0,1,2,6,17
%N A136868 Table read by antidiagonals: T(n,k) is the number of connected directed multigraphs with loops with n arcs and k vertices, which are transitive (the existence of a path between two points implies the existence of an arc between those two points).
%C A136868 Partial sums of the rows of A139624, i.e., T(n,k) = sum(T139624(n,p),p=0..k).
%C A136868 T(0,k) = 1 for k>=0; T(n,0) = 0 and T(n,1) = 1 for n>0.
%C A136868 If k>=n+1, T(n,k) = A139629(n).
%e A136868 Triangle begins:
%e A136868 1,
%e A136868 1, 0,
%e A136868 1, 1, 0,
%e A136868 1, 2, 1, 0,
%e A136868 1, 2, 4, 1, 0,
%e A136868 1, 2, 6, 7, 1, 0,
%e A136868 1, 2, 6,14,12, 1, 0,
%Y A136868 Cf. A138352.
%K A136868 more,nonn,tabl
%O A136868 0,8
%A A136868 _Benoit Jubin_, May 11 2008