Triangle T(n,k) read by rows: T(n,k) = number of cycles of length 2k in the binary n-cube, for n >= 2, k = 2, 3, ..., 2^(n-1).
1, 6, 16, 6, 24, 128, 696, 2112, 5024, 5376, 1344, 80, 640, 6720, 68736, 591200
3 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)
Sun Nov 15 11:04:04 CET 2009 [seqfan] Re: number of k-cycles for n-simplex, n-cube, n-orthoplex (Also Errors in A085452)
Sun Nov 15 07:58:58 CET 2009 [seqfan] number of k-cycles for n-simplex, n-cube, n-orthoplex (Also Errors in A085452)
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.