The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A263863 Triangle read by rows: T(n,k) (n>=0, k>=n+1) is the number of posets with n elements and k chains. 0
 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 3, 3, 2, 2, 0, 3, 0, 0, 0, 1, 1, 1, 3, 5, 8, 5, 7, 4, 8, 2, 5, 1, 5, 0, 3, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,7 COMMENTS Row sums give A000112. LINKS FindStat - Combinatorial Statistic Finder, The number of chains of a poset. EXAMPLE Triangle begins: 1, 1, 1,1, 1,1,2,0,1, 1,1,3,3,2,2,0,3,0,0,0,1, 1,1,3,5,8,5,7,4,8,2,5,1,5,0,3,0,0,0,4,0,0,0,0,0,0,0,1, ... CROSSREFS Cf. A000112. Sequence in context: A254045 A024996 A187596 * A134655 A262124 A199954 Adjacent sequences:  A263860 A263861 A263862 * A263864 A263865 A263866 KEYWORD nonn,tabf AUTHOR Christian Stump, Oct 28 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 7 23:50 EDT 2022. Contains 355995 sequences. (Running on oeis4.)