来自在线整数百科全书的问候语!1-1,1 AI 2631,1,2,7,23,13,17,47,47,212119124499,1039,79,%,T,A122631 97,23 36724132472477885 7847,61,8399,531600 71033,43,%,U A122631 1665 7101,67,19,3139269107109197999 77927 41257,47 10319717911719,http://oei.org/y*搜索:ID:A122631显示5503πn a122631 a(n+1)=gpf(2×素数(a(n-1))+素数(a(n))),其中gpf=最大素数因子,a(0)=1,a(1)=2 .% %c a122631,该序列最终以周期360为周期。n,a(n)n=0…10000的表+素数(23)=2×17+83=117=3*3*13,因此A(4)=GPF(4)=y.% %t A122631转置[ NeSTLIST[{Y]([Y]),因子整数[2Prim[O[[Y] ] +Prime [A] [[[Y] ] }[[{YO},] ] [[[Y] ] %AO A122631(Haskell)%O O A122631 A122631 N=A122631,列表!!!(低于Zumkeller的97)% %E A122631 2*Prime(7)(N-1)%AO A122631 A122631×LISTAL=%%O A122631 1:2:MAP A000 630(ZIPOF(+))(MAP(2×))。A122631列表)-A%A122631——Aug Read Hand ZunkeleLyg,Aug 07 A.A122631(PARI)A== [1,2];(n=2,50,My(F=因子(2×Prime(A[N-1)+Prime(A[N])],[1,]);A=ChanthR.GraseSube IVI,6月19日2013‰YA122631 CF.A063030.K A122631尼斯,NON,A000 000 31)A122631列表(%AO A122631)(MAP A000 000 40(尾部)A0122631,02%,A122631,CAROS ALVESIO,10月29日2006‰E A122631偏移固定和初始1由O-ReNeultZunkeleRez,Aug 07 2011‰内容准备在OEIS最终用户许可协议:HTTP:/OEIS.Org/许可证下可用