The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A339807 Irregular triangle read by rows: T(n,k) (n>=2, k>=1) is the number of strong digraphs on n nodes with k descents. 3
 1, 2, 11, 5, 10, 154, 540, 581, 272, 49, 122, 3418, 27304, 90277, 150948, 150519, 95088, 37797, 8714, 893, 3346, 142760, 1938178, 12186976, 42696630, 94605036, 145009210, 161845163, 134933733, 84656743, 39632149, 13481441, 3156845, 455917, 30649 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 LINKS Kassie Archer, Ira M. Gessel, Christina Graves, and Xuming Liang, Counting acyclic and strong digraphs by descents, arXiv:1909.01550 [math.CO], 20 Mar 2020. EXAMPLE Triangle begins: 1; 2, 11, 5; 10, 154, 540, 581, 272, 49; 122, 3418, 27304, 90277, 150948, 150519, 95088, 37797, 8714, 893; 3346, 142760, 1938178, 12186976, 42696630, 94605036, 145009210, 161845163, 134933733, 84656743, 39632149, 13481441, 3156845, 455917, 30649; ... CROSSREFS Cf. A003030 (row sums), A057273 (another version of the same triangle), A307049, A339590. Sequence in context: A009301 A087552 A124688 * A158616 A127821 A114724 Adjacent sequences:  A339804 A339805 A339806 * A339808 A339809 A339810 KEYWORD nonn,tabf AUTHOR Hugo Pfoertner, Dec 28 2020 EXTENSIONS Row 2 added by N. J. A. Sloane, Dec 29 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 16 08:46 EDT 2021. Contains 345056 sequences. (Running on oeis4.)