Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of ways an undirected cycle of length k can be built from n labeled nodes.
1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 6, 4, 3, 1, 5, 10, 10, 15, 12, 1, 6, 15, 20, 45, 72, 60, 1, 7
2 seqfan posts
Sun Nov 15 11:36:30 CET 2009 [seqfan] Re: number of k-cycles for n-simplex, n-cube, n-orthoplex (Also Errors in A085452)