|
|
|
|
1, 3, 3, 4, 3, 9, 4, 7, 3, 9, 9, 12, 4, 12, 7, 11, 3, 9, 9, 12, 9, 27, 12, 21, 4, 12, 12, 16, 7, 21, 11, 18, 3, 9, 9, 12, 9, 27, 12, 21, 9, 27, 27, 36, 12, 36, 21, 33, 4, 12, 12, 16, 12, 36, 16, 28, 7, 21, 21, 28, 11, 33, 18, 29, 3, 9, 9, 12, 9, 27, 12, 21, 9, 27, 27, 36, 12, 36, 21, 33, 9, 27, 27, 36, 27
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
偏移
|
0,2
|
|
评论
|
这是S(n)=Lucas(n+1)=1,3,4,7,11,…的游程变换,。。。(参见。A000204号).
序列{S(n),n>=0}的游程变换定义为由T(n)=Product_i S(i)给出的序列{T(n。所以T(19)=S(1)*S(2)。T(0)=1(空乘积)。
|
|
链接
|
|
|
例子
|
1;
三;
3,4;
3,9,4,7;
3,9,9,12,4,12,7,11;
3,9,9,12,9,27,12,21,4,12,12,16,7,21,11,18;
3,9,9,12,9,27,12,21,9,27,27,36,12,36,21,33,4,12,12,16,12,36,16,28,7,21,21,28,11,33,18,29;
...
右边框显示Lucas数字(以1开头)。这只是重申了一个定理,即这个序列是A000204号.
(结束)
|
|
MAPLE公司
|
ans:=[];
对于从0到100的n,做lis:=[];t1:=换算(n,基数,2);L1:=nops(t1);
out1:=1;c: =0;
对于i从1到L1 do
如果out1=1且t1[i]=1,则out1:=0;c: =c+1;
elif out1=0且t1[i]=1,则c:=c+1;
elif out1=1且t1[i]=0,则c:=c;
elif输出1=0且t1[i]=0,则lis:=[c,op(lis)];out1:=1;c: =0;
fi;
如果i=L1且c>0,则lis:=[c,op(lis)];fi;
日期:
ans:=[op(ans),a];
日期:
ans;
|
|
交叉参考
|
|
|
关键词
|
非n,基础
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|