|
| |
| |
|
|
|
1, 2, 3, 2, 3, 3, 4, 5, 4, 5, 6, 7, 5, 6, 7, 6, 7, 7, 8, 9, 10, 11, 8, 9, 10, 11, 9, 10, 11, 10, 11, 12, 13, 14, 11, 12, 13, 14, 15, 12, 13, 14, 15, 13, 14, 15, 14, 15, 15, 16, 17, 16, 17, 18, 19, 20, 21, 22, 23, 17, 18, 19, 20, 21, 22, 23, 18, 19, 20, 21, 22, 23, 19, 20, 21, 22, 23, 20, 21, 22, 23, 21, 22, 23
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,2
|
|
|
评论
|
|
|
|
链接
|
迈克尔·德弗利格，绘图（n，m）其中m是该序列第n行中的项，对于第1行<=n<=1024。
|
|
|
例子
|
以下是三角形的第一条链：
1, 2, 3;
2, 3;
3, 4, 5;
4, 5, 6, 7;
5, 6, 7;
6, 7;
7, 8, 9, 10, 11;
8, 9, 10, 11;
9, 10, 11;
10, 11, 12, 13, 14;
...
|
|
|
数学
|
块[{nn=24，r}，r=数组[If[#==1，0，Total[2^（PrimePi/@FactorInteger[#][[All，1]-1）]&，nn+天花板@Sqrt@nn]；数组[Block[{k=#+1，s=r[[#]]}，While[UnsameQ[s，Set[s，BitOr[s，r[[k]]]]，k++]；范围[#，k-1]]&，nn]]//平坦(*迈克尔·德弗利格2020年5月2日*）
|
|
|
交叉参考
|
|
|
|
关键词
|
非n,标签
|
|
|
作者
|
|
|
|
扩展
|
|
|
|
状态
|
经核准的
|
| |
|
|
