登录
OEIS由OEIS基金会的许多慷慨捐赠者.

 

标志
提示
(来自的问候整数序列在线百科全书!)
A321098型 常数z的十进制展开式满足:CF(6*z,n)=CF(z,n。 8
1, 0, 8, 3, 6, 3, 0, 8, 6, 3, 8, 5, 3, 2, 5, 0, 4, 9, 4, 3, 1, 8, 7, 0, 3, 5, 8, 7, 6, 4, 2, 7, 1, 2, 7, 8, 7, 6, 5, 9, 7, 6, 8, 5, 9, 5, 3, 4, 9, 3, 1, 1, 7, 3, 8, 4, 0, 5, 0, 9, 7, 5, 6, 9, 3, 1, 9, 6, 0, 0, 0, 1, 7, 3, 4, 1, 1, 0, 0, 7, 2, 2, 3, 7, 7, 3, 5, 2, 1, 5, 7, 9, 8, 1, 5, 2, 2, 6, 5, 6, 3, 7, 4, 6, 0, 3, 3, 5, 4, 8, 9, 6, 6, 2, 5, 1, 2, 7, 5, 0, 2, 9, 4, 5, 1, 2, 3, 5, 2, 5, 5, 9, 1, 7, 1, 5, 4, 8, 6, 9, 5, 5, 0, 4, 1, 4, 5, 4, 7, 3, 4, 6, 4, 5, 6, 0, 1, 8, 9, 8, 3, 2, 6, 6, 5, 9, 0, 6, 9, 5, 0, 9, 0, 2, 9, 8 (列表;常数;图表;参考;;历史;文本;内部格式)
抵消
0,3
链接
例子
此常数z的十进制展开式开始于:
z=10.8363086385325049431870358764271278765976859589534931。。。
z的简单连分式展开开始:
z=[10;1,5,9,5,1,9,5,1,9,1,5,9。。。,A321097型(n) ,…];
使得6*z的简单连续分数膨胀开始:
6*z=[65;56、60、64、60、56、64、六十、五十六、64、五十六。。。,A321097型(n) +55,…]。
扩展条款。
z的十进制展开式中的前1000位是
z=10.83630863853250494318703587642712787659768595895349311\
73840509756931960001734110072237735215798152265637\
46033548966251275029451235255917154869550414547346\
45601898326659069509029896766448634581870902999261\
78291099037993947368425232025742840508201019811150\
20208289541868116590985746685817208034834182741861\
61586263073936595659616093596727391439370392218179\
08547782927594504604528661115974783060857978290729\
53554586787471663938331763610007750862560295292956\
22583160832720034539915220107654291931753328805663\
44405451280922502018454665640681719991329902449206\
06333718948414803434770198192597675071144159105469\
40129387536502210902718153383173369508615022733071\
21561771111264471719424048701509094587624798702003\
98051339274318126056502629341701820569809346581703\
17900710636878987844980734936343020769115171474588\
61969660741202379814909712010859009313616125172084\
48790047790048120552938902316397984428482656427316\
35549261064509815824229787948467548551187722067240\
97844304015886508690953002055508602378218606168521...
...
z的连分数的最初1020项是
z=[10;1,5,9,5,1,9,5A,1,9,1,5,9,15,95,1,5,10,9,10,5,15,9,
5,1,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,
5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,
1,5,9,1,5,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,
1,5,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,5,1,9,
5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,
1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,
1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,
5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,1,5,9,5,1,9,
1,5,9,5,1,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,
5,1,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,
5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,
1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,
5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,
5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,
1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,
1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,1,5,9,
5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,
1,5,9,5,1,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,
5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,
5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,
1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,
1,5,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,
5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,5,1,9,5,1,9,
1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,
1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,
5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,
1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,
5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,
5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,
1,5,9,1,5,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,
1,5,9,5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,5,1,9,
5,1,9,1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,1,5,9,5,1,9,
1,5,9,1,5,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9,5,1,9,5,1,9,1,5,9, ...].
...
生成方法。
从CF=[10]开始,然后重复(PARI代码):
{M=contfracpnqn(CF+向量(#CF,i,55));
z=(1/6)*M[1,1]/M[2,1];CF=控制(z)}
该方法可以如下所示。
z0=[10]=10;
z1=(1/6)*[65]=[10;1,5]=65/6;
z2=(1/6)*[65;56,60]=[10;1,5,9,5,1,9,6]=218525/20166;
z3=(1/6)*[65;56、60、64、60、56、64、61]=[10;1、5、9、1、9、9、1,5、9,1、5,9、5,1、9,5、1,9、1,5、10]=30617277049665/2825434201901;
z4=(1/6)*[65;56,60,64,60,56,64,6056,56,56第五、九、一、五、九、五、一、九、一五、九五、五、一九、一十条] = 235326213809918755668077578309692661245/21716455451732827969266335806481498321;
其中,常数z等于上述过程的迭代极限。
黄体脂酮素
(PARI)/*生成6000多个数字*/
{CF=[10];对于(i=1,8,M=contfracpnqn(CF+向量(#CF,i,55));z=(1/6)*M[1,1]/M[2,1];CF=contfrac(z))}
对于(n=0200,print1(楼层(10^(n-1)*z)%10,“,”)
交叉参考
关键词
非n,欺骗
作者
保罗·D·汉纳2018年10月28日
状态
经核准的

查找|欢迎光临|维基|注册|音乐|地块2|演示|索引|浏览|更多|网络摄像头
贡献新序列。或评论|格式|样式表|变换|超级搜索引擎|最近
OEIS社区|维护人OEIS基金会。

许可协议、使用条款、隐私政策。.

上次修改时间:美国东部夏令时2024年6月24日12:27。包含373677个序列。(在oeis4上运行。)