|
Search: id:A047996
|
|
|
| A047996 |
|
Triangle of circular binomial coefficients T(n,k), 0<=k<=n. |
|
+0
18
|
|
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 3, 4, 3, 1, 1, 1, 1, 3, 5, 5, 3, 1, 1, 1, 1, 4, 7, 10, 7, 4, 1, 1, 1, 1, 4, 10, 14, 14, 10, 4, 1, 1, 1, 1, 5, 12, 22, 26, 22, 12, 5, 1, 1, 1, 1, 5, 15, 30, 42, 42, 30, 15, 5, 1, 1, 1, 1, 6, 19, 43, 66, 80, 66, 43, 19, 6, 1, 1, 1, 1, 6, 22
(list; table; graph; listen)
|
|
|
OFFSET
|
0,13
|
|
|
COMMENT
|
T(n,k)=number of necklaces with k black beads, n-k white beads.
|
|
REFERENCES
|
D. E. Knuth, Computer science and its relation to mathematics, Amer. Math. Monthly, 81 (1974), 323-343.
F. Ruskey and J. Sawada, "An Efficient Algorithm for Generating Necklaces with Fixed Density", SIAM J. Computing, 29 (1999) 671-684.
H. S. Wilf, personal communication, Nov., 1990.
|
|
LINKS
|
T. D. Noe, Rows n=0..50 of triangle, flattened
F. Ruskey, Necklaces
Index entries for sequences related to necklaces
|
|
FORMULA
|
T(n, k)=(1/n) * Sum_{d | (n, k)} phi(d)*binomial(n/d, k/d).
T(2*n,n)=A003239(n) . T(2*n+1,n)=A000108(n) . - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Jul 25 2006
|
|
EXAMPLE
|
1; 1,1; 1,1,1; 1,1,1,1; 1,1,2,1,1; 1,1,2,2,1,1; 1,1,3,4,3,1,1; ...
|
|
CROSSREFS
|
Row sums: A000031. Columns 0-12: A000012, A000012, A004526, A007997(n-3), A008610, A008646, A032191-A032197.
Cf. A051168, A052307, A052311-A052313.
Adjacent sequences: A047993 A047994 A047995 this_sequence A047997 A047998 A047999
Sequence in context: A052307 A067059 A049704 this_sequence A063686 A008327 A133687
|
|
KEYWORD
|
nonn,tabl,easy,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
