|
Search: id:A063686
|
|
|
| A063686 |
|
Triangular array: a(n,k) is the number of binary necklaces (no turning over) of length n whose longest run of 1's has length k. Table begins at n=1, k=0. |
|
+0
1
|
|
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 4, 4, 2, 1, 1, 1, 1, 4, 6, 4, 2, 1, 1, 1, 1, 7, 11, 8, 4, 2, 1, 1, 1, 1, 9, 19, 14, 8, 4, 2, 1, 1, 1, 1, 14, 33, 27, 16, 8, 4, 2, 1, 1, 1, 1, 18, 56, 50, 30, 16, 8, 4, 2, 1, 1, 1, 1, 30, 101, 96, 59, 32, 16, 8, 4, 2, 1, 1, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,11
|
|
|
COMMENT
|
Column k=1 appears to be A032190(n), n=2,3,...
|
|
EXAMPLE
|
Rows: {1,1}; {1,1,1}; {1,1,1,1}; {1,2,1,1,1}
|
|
CROSSREFS
|
Cf. A032190, A048004.
Sequence in context: A067059 A049704 A047996 this_sequence A008327 A133687 A097587
Adjacent sequences: A063683 A063684 A063685 this_sequence A063687 A063688 A063689
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Christopher Lenard (c.lenard(AT)bendigo.latrobe.edu.au), Aug 22 2001
|
|
|
Search completed in 0.002 seconds
|
