A208650 Number of constant paths through the subset array of {1,2,...,n}; see Comments.
1, 2, 6, 36, 480, 15000, 1134000, 211768200, 99131719680, 117595223746560, 356467003200000000, 2779532232516963000000, 56049508602150185041920000, 2935889842347365340037522521600
Offset: 1
Keywords
Examples
Taking n=3: row 1: {1},{2},{3} ---------> 1,2,3 row 2: {1,2},{1,3},{2,3} ---> 1,1,2,2,3,3 row 3: {1,2,3} -------------> 1,2,3 3 ways to choose a number from row 1, 2 ways to choose same number from row 2, 1 way to choose same number from row 3. Total: a(3) = 1*2*3 = 6 paths.
Crossrefs
Cf. A208651.
Programs
Formula
a(n) = n*Product_{k=1..n-1} binomial(n-1,k). - Jason Yuen, Feb 18 2025
Comments