来自在线整数百科全书的问候语!http://oeis.org/ Search: id:a007377 Showing 1-1 of 1 %I A007377 M0485 %S A007377 0,1,2,3,4,5,6,7,8,9,13,14,15,16,18,19,24,25,27,28,31,32,33,34,35,36, %T A007377 37,39,49,51,67,72,76,77,81,86 %N A007377 Numbers n such that the decimal expansion of 2^n contains no 0. %C A007377 It is an open problem of long standing to show that 86 is the last term. %C A007377 A027870(a(n)) = A224782(a(n)) = 0. 4月30日,2013岁的C A000 737 7见A030700为3 ^ N的模拟,这似乎以n=68结束。- M·F·HasLeLyr,MAR 07×2014 %C A000 737 7检验到n=10 ^ 10。12月29日,2015岁,J. S. Madachy,数学,度假,Scribner,NY,1966,第126页。第%A000 737 7,N.J.A.斯隆和Simon Plouffe,整数序列百科全书,学术出版社,1995(包括这个序列)。Python脚本搜索零位数的幂%H A000 737 7 W. Schneider,NoZeros:没有数字零的幂n^ k[高速缓存副本] %AH A00 737 7 Eric Weisstein的数学世界,%H A000 737 7 R.G.威尔逊,V,写给新泽西州的信,10月1993日%P A000 737 7删除(t->有(转换(2 ^,基,10),0),[ 0美元…1000 ]);12月29日,2015年%T A000 737 7 DO [IF [联数码[2 ^ n] [[1 ] ] [[1 ] ]!= 0,Prime[n],{n,1, 60000 } }%t A000 737选择[范围@ 1000,第一@联合@整数数字] [2 ^ ^ ]!= 0 &] %t A007377 Select[Range[0,100],DigitCount[2^#,10,0]==0&] (* _Harvey P. Dale_, Feb 06 2015 *) %o A007377 (MAGMA) [ n: n in [0..50000] | not 0 in Intseq(2^n) ]; // _Bruno Berselli_, Jun 08 2011 %o A007377 (Perl) use bignum; %o A007377 for(0..99) { %o A007377 if((1<<$_) =~ /^[1-9]+$/) { %o A007377 print "$_, " %o A007377 } %o A007377 } # _Charles R Greathouse IV_, Jun 30 2011 %o A007377 (PARI) for(n=0,99,if(vecmin(eval(Vec(Str(2^n)))),print1(n", "))) \\ _Charles R Greathouse IV_, Jun 30 2011 %o A007377 (Haskell) %o A007377 import Data.List (elemIndices) %o A007377 a007377 n = a007377_list !! (n-1) %o A007377 a007377_list = elemIndices 0 a027870_list %o A007377 -- _Reinhard Zumkeller_, Apr 30 2013 %Y A007377 Cf. A027870, A030700, A102483. %Y A007377 Cf. similar sequences listed in A035064. %K A007377 base,nonn %O A007377 1,3 %A A007377 _N. J. A. Sloane_, _Robert G. Wilson v_ %E A007377 a(1) = 0 prepended by _Reinhard Zumkeller_, Apr 30 2013 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE