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

 


A133835号
素数增长最慢的序列,两个相邻项至少共享两个数字(以重数计算)。
1
11, 101, 103, 107, 109, 139, 149, 179, 191, 193, 197, 199, 419, 421, 431, 433, 439, 443, 449, 479, 487, 547, 557, 571, 577, 587, 751, 757, 773, 787, 797, 877, 887, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193
抵消
1,1
评论
其他种子的序列:
{11,101,103,107,109,139,149,179,191,193,197,199,419,421,431,433,439},
{13,31,103,107,109,139,149,179,191,193,197,199,419,421,431,433,439},
{17,71,107,109,139,149,179,191,193,197,199,419,421,431,433,439},
{19,109,139,149,179,191,193,197,199,419,421,431,433,439},
{23,223,227,229,239,263,269,293,349,359,379,389,397,439},
{29,229,239,263,269,293,349,359,379,389,397,439},
{31,103,107,109,139,149,179,191,193,197,199,419,421,431,433,439},
{37,73,137,139,149,179,191,193,197,199,419,421,431,433,439},
{41,149,179,191,193,197,199,419,421,431,433,439},
{43,347,349,359,379,389,397,439},
{47,347,349,359,379,389,397,439},
{53,353,359,379,389,397,439},
{59,359,379,389,397,439},
{61,163,167,173,179,191,193,197,199,419,421,431,433,439},
{67,167,173,179,191,193,197,199,419,421,431,433,439},
{71,107,109,139,149,179,191,193,197,199,419,421,431,433,439}.
推测:对于任何初始种子,序列最终都会与第一个种子合并。
数学
MultiIntersection[l1_List,l2_List]:=模块[{nl,f},f[x_]:={First[#],Length[#]}&/@Split[Sort[x]];nl=排序[Join[Flatten[Map[f,{l1,l2}],1]];nl=拆分[nl,#[[1]]===#2[[1]]&];压扁[Cases[nl,{{x_,m_},{x_、n_}}:->表[x,{m}]],1]]f:=(a=素数[k];ida=整数位数[a];c=1;s[1]=a;Do[p=素数[1];If[Length[MultiIntersection[ida,IntegerDigits[p]]>1,c++;s[c]=p;a=p;ida=整型位数[a]],{i,k+1,100}];s[#]//@范围[c]);表[f,{k,5,20}]
关键词
非n,基础
作者
扎克·塞多夫,2007年9月26日
状态
经核准的

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

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

上次修改时间:2024年9月23日18:10 EDT。包含376182个序列。(在oeis4上运行。)