来自在线整数百科全书的问候语!http://oei.org/y*搜索:ID:A13497(1),A113497,A135697,1,4,11,31 1064021953,%N A13497 A(n)给出了A075053(m)的最大值,在A075053(m)中,n个数M .C %A13497,以数个不同的方式获得m的排列,得到的素数是数次。参见序列A0767,它使用A03999代替,即只计算不同的素数。- 3月11日M.F.HasLeLy.,2014 N %C A13497,n=3, 4, 5的原始数据是错误的A000 726(n)。-n=6,A(n)=A0767 30(n),但两个将不迟于n=10,其中A13496(10)=1123456789给出A(10)>398100=A075053(1123456789)>A03999(1123456789)=362451=A0767 30(10)。产生差异的原因是每一个包含一个“1”的素数将被A075053计数两次,但只有一次由A03993计算。-基思·哈斯勒尔,10月14日2019包含许多嵌入素数的整数%F A13497 A(n)<=A00 75 26(n),具有相等的IFF n<2。〔基思〕{013997 A(n)=max {a075053(m);10 ^(n-1)<m<10 ^ n}=a0767 30(n)=max {a0399 93m(m);10 ^(n-1)<m<10 ^ n}。- _M. F. Hasler_, Mar 11 2014 %e A134597 From _M. F. Hasler_, Oct 14 2019: (Start) %e A134597 a(2) = 4 = A075053(37), because from 37 one can obtain the primes {3, 7, 37, 73}, and there is obviously no 2-digit number which could give more primes. %e A134597 a(3) = 11 = A075053(137), because from 137 one can obtain the primes {3, 7, 13, 17, 31, 37, 71, 73, 137, 173, 317}, and no 3-digit number yields more. %e A134597 a(4) = 31 = A075053(1379), because from 1379 one can obtain the 31 primes {3, 7, 13, 17, 19, 31, 37, 71, 73, 79, 97, 137, 139, 173, 179, 193, 197, 317, 379, 397, 719, 739, 937, 971, 1973, 3719, 3917, 7193, 9137, 9173, 9371}, and no 4-digit number yields more. %e A134597 a(5) = 106 = A075053(13679). A(6)=402=A075053(123479).e %A13497 A(7)=1953=A075053(1234679)。(End) %o A134597 (PARI) A134597(n)={my(m=0);forvec(D=vector(n,i,[0,9]), vecsum(D)%3||next;m=max(A075053(fromdigits(D),D),m),1);m} \\ _M. F. Hasler_, Oct 14 2019 %Y A134597 Cf. A075053, A039993, A134596. %Y A134597 Cf. A239196 for record indices of A075053, A239197 for associated record values. %K A134597 nonn,base,more %O A134597 1,2 %A A134597 _N. J. A. Sloane_, Jan 25 2008 %E A134597 Link fixed by _Charles R Greathouse IV_, Aug 13 2009 %E A134597 Definition corrected by _M. F. Hasler_, Mar 11 2014 %E A134597 Data corrected and extended by _M. F. Hasler_, Oct 14 2019 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE