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!)
 A262494 Triangle read by rows: T(n,k) (n>=1, 0<=k
 1, 1, 1, 1, 4, 1, 1, 13, 8, 2, 1, 41, 49, 23, 6, 1, 131, 276, 198, 90, 24 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS It appears that no recurrence or g.f. is known. - N. J. A. Sloane, Oct 13 2015 LINKS FindStat - Combinatorial Statistic Finder, The number of stack-sorts needed to sort a permutation FORMULA T(n,0) = 1, T(n,1) = A000108(n) - 1. - Joerg Arndt, Sep 27 2015 EXAMPLE Triangle begins: 1, 1, 1, 1, 4, 1, 1, 13, 8, 2, 1, 41, 49, 23, 6, 1,131,276,198,90,24, ... CROSSREFS Sequence in context: A140070 A158815 A101275 * A039755 A247502 A047874 Adjacent sequences:  A262491 A262492 A262493 * A262495 A262496 A262497 KEYWORD nonn,tabl,more AUTHOR Christian Stump, Sep 24 2015 EXTENSIONS Definition edited by N. J. A. Sloane, Oct 13 2015 Added more terms Christian Stump, Oct 19 2015 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 April 15 06:12 EDT 2021. Contains 342975 sequences. (Running on oeis4.)