|
|
A329327飞机 |
| 二元展开的Lyndon因式分解长度为2(n>1的最小值)的数字。 |
|
6
|
|
|
2, 3, 5, 9, 11, 17, 19, 23, 33, 35, 37, 39, 43, 47, 65, 67, 69, 71, 75, 77, 79, 87, 95, 129, 131, 133, 135, 137, 139, 141, 143, 147, 149, 151, 155, 157, 159, 171, 175, 183, 191, 257, 259, 261, 263, 265, 267, 269, 271, 275, 277, 279, 281, 283, 285, 287, 293
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,1
|
|
评论
|
|
|
链接
|
|
|
配方奶粉
|
|
|
例子
|
每个项的二进制展开及其Lyndon因式分解开始:
2: (10) = (1)(0)
3: (11) = (1)(1)
5: (101) = (1)(01)
9: (1001) = (1)(001)
11: (1011) = (1)(011)
17: (10001) = (1)(0001)
19: (10011) = (1)(0011)
23: (10111) = (1)(0111)
33: (100001) = (1)(00001)
35:(100011)=(1)(00011)
37: (100101) = (1)(00101)
39: (100111) = (1)(00111)
43: (101011) = (1)(01011)
47: (101111) = (1)(01111)
65: (1000001) = (1)(000001)
67: (1000011) = (1)(000011)
69: (1000101) = (1)(000101)
71: (1000111) = (1)(000111)
75: (1001011) = (1)(001011)
77: (1001101) = (1)(001101)
|
|
数学
|
lynQ[q_]:=数组[Union[{q,RotateRight[q,#]}]=={q,旋转右[q,#]}&,长度[q]-1,1,And];
lynfac[q_]:=如果[Length[q]==0,{},函数[i,前缀[lynfac[Drop[q,i]],Take[q,i]][Last[Select[Range[Length[q]],lynQ[Take[q,#1]]&]]];
选择[范围[100],长度[lynfac[整数位数[#,2]]]==2&]
|
|
交叉参考
|
囊性纤维变性。A059966号,A060223号,A211097型,A275692型,A328594型,A328595型,A328596型,A329131型,A329313型,A329325型,A329326飞机,A339608型.
|
|
关键词
|
非n
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|