A063596 -id:A063596 - cp's OEIS frontend

A031146 Exponent of the least power of 2 having exactly n zeros in its decimal representation.

0, 10, 42, 43, 79, 88, 100, 102, 189, 198, 242, 250, 252, 263, 305, 262, 370, 306, 368, 383, 447, 464, 496, 672, 466, 557, 630, 629, 628, 654, 657, 746, 771, 798, 908, 913, 917, 906, 905, 1012, 1113, 988, 1020, 989, 1044, 1114, 1120, 1118, 1221, 1218, 1255

Offset: 0

N. J. A. Sloane

			a(3) = 43 since 2^m contains 3 0's for m starting with 43 (2^43 = 8796093022208) and followed by 53, 61, 69, 70, 83, 87, 89, 90, 93, ...

T. D. Noe, Table of n, a(n) for n = 0..1000

Cf. A000079, A007377, A031147, A006889.

Cf. A063555 (analog for 3^k), A063575 (for 4^k), A063585 (for 5^k), A063596 (for 6^k), A063606 (for 7^k), A063616 (for 8^k), A063626 (for 9^k).

a = {}; Do[k = 0; While[ Count[ IntegerDigits[2^k], 0] != n, k++ ]; a = Append[a, k], {n, 0, 50} ]; a (* Robert G. Wilson v, Jun 12 2004 *)
nn = 100; t = Table[0, {nn}]; found = 0; k = 0; While[found < nn, k++; cnt = Count[IntegerDigits[2^k], 0]; If[cnt <= nn && t[[cnt]] == 0, t[[cnt]] = k; found++]]; t = Join[{0}, t] (* T. D. Noe, Mar 14 2012 *)

A031146(n)=for(k=0, oo, #select(d->!d, digits(2^k))==n&&return(k)) \\ M. F. Hasler, Jun 15 2018

More terms from Erich Friedman

Definition clarified by Joerg Arndt, Sep 27 2016

A063575 Smallest k such that 4^k has exactly n 0's in its decimal representation.

Original entry on oeis.org

0, 5, 21, 35, 47, 44, 50, 51, 103, 99, 121, 125, 126, 175, 166, 131, 185, 153, 184, 223, 272, 232, 248, 336, 233, 306, 315, 384, 314, 327, 333, 373, 393, 399, 454, 457, 504, 453, 484, 506, 621, 494, 510, 639, 522, 557, 560, 559, 716, 609, 629

Offset: 0

Robert G. Wilson v, Aug 10 2001

Harvey P. Dale, Table of n, a(n) for n = 0..1000 (first 150 terms from Harry J. Smith; a(0) modified by M. F. Hasler).

Cf. A031146 (analog for 2^k), A063555 (for 3^k), A063585 (for 5^k), A063596 (for 6^k), A063606 (for 7^k), A063616 (for 8^k).

a = {}; Do[k = 0; While[ Count[ IntegerDigits[4^k], 0] != n, k++ ]; a = Append[a, k], {n, 0, 50} ]; a
Module[{nn=750,p4},p4=Table[{n,DigitCount[4^n,10,0]},{n,nn}];Transpose[ Table[ SelectFirst[p4,#[[2]]==i&],{i,0,50}]][[1]]] (* The program uses the SelectFirst function from Mathematica version 10 *) (* Harvey P. Dale, May 20 2016 *)

Count(x, d)= { local(c,f); c=0; while (x>9, f=x-10*(x\10); if (f==d, c++); x\=10); if (x==d, c++); return(c) } { for (n=0, 150, a=0; while (Count(4^a, 0) != n, a++); write("b063575.txt", n, " ", a) ) } \\  Harry J. Smith, Aug 26 2009

A063575(n)=for(k=n,oo,#select(d->!d,digits(4^k))==n&&return(k)) \\ M. F. Hasler, Jun 14 2018

a(0) changed to 0 as in A031146, A063555, ... by M. F. Hasler, Jun 14 2018

A063585 Least k >= 0 such that 5^k has exactly n 0's in its decimal representation.

Original entry on oeis.org

0, 8, 13, 34, 40, 48, 52, 45, 64, 99, 143, 132, 100, 122, 117, 151, 205, 207, 201, 242, 230, 244, 231, 221, 295, 264, 266, 333, 248, 344, 346, 274, 391, 345, 356, 393, 433, 365, 472, 499, 488, 455, 516, 485, 511, 458, 520, 487, 459, 456, 457

Offset: 0

Robert G. Wilson v, Aug 10 2001

Robert Israel, Table of n, a(n) for n = 0..3373
M. F. Hasler, Zeroless powers. OEIS Wiki, March 2014

Cf. A031146 (analog for 2^k), A063555 (analog for 3^k), A063575 (analog for 4^k), A063596 (analog for 6^k).

N:= 100: # to get a(0)..a(N)
A:= Array(0..N, -1):
p:= 1: A[0]:= 0:
count:= 1:
for k from 1 while count <= N do
  p:= 5*p;
  m:= numboccur(0, convert(p, base, 10));
  if m <= N and A[m] < 0 then A[m]:= k; count:= count+1;
od:
convert(A,list); # Robert Israel, Dec 20 2018

a = {}; Do[k = 0; While[ Count[ IntegerDigits[5^k], 0] != n, k++ ]; a = Append[a, k], {n, 0, 50} ]; a

A063585(n)=for(k=n,oo,#select(d->!d,digits(5^k))==n&&return(k)) \\ M. F. Hasler, Jun 14 2018

a(0) changed to 0 (as in A031146, A063555, ...) and better title from M. F. Hasler, Jun 14 2018

A063606 Smallest k >= 0 such that 7^k has exactly n 0's in its decimal representation.

Original entry on oeis.org

0, 4, 9, 13, 25, 55, 39, 41, 45, 70, 69, 65, 75, 107, 109, 134, 167, 142, 156, 196, 157, 205, 214, 180, 213, 183, 162, 251, 263, 276, 268, 290, 306, 295, 369, 313, 332, 293, 353, 340, 357, 387, 367, 476, 334, 509, 363, 474, 454, 488, 453

Offset: 0

Robert G. Wilson v, Aug 10 2001

Cf. A031146 (analog for 2^k), A063555 (analog for 3^k), A063575 (analog for 4^k), A063585 (for 5^k), A063596 (analog for 6^k).

a = {}; Do[k = 0; While[ Count[ IntegerDigits[7^k], 0] != n, k++ ]; a = Append[a, k], {n, 0, 50} ]; a
Module[{p7=DigitCount[#,10,0]&/@(7^Range[600]),nn=60},Join[{0},Flatten[ Table[ Position[p7,n,1,1],{n,nn}]]]] (* Harvey P. Dale, Apr 12 2022 *)

A063606(n)=for(k=n, oo, #select(d->!d, digits(5^k))==n&&return(k)) \\ M. F. Hasler, Jun 14 2018

A063616 Smallest k >= 0 such that 8^k has exactly n 0's in its decimal representation.

Original entry on oeis.org

0, 4, 14, 23, 42, 33, 35, 34, 63, 66, 87, 116, 84, 101, 126, 164, 128, 102, 135, 143, 149, 155, 203, 224, 186, 204, 210, 237, 261, 218, 219, 286, 257, 266, 361, 355, 336, 302, 374, 339, 371, 398, 340, 409, 348, 388, 494, 436, 407, 406, 439

Offset: 0

Robert G. Wilson v, Aug 10 2001

Cf. A031146 (analog for 2^k), A063555 (analog for 3^k), A063575 (analog for 4^k), A063585 (for 5^k), A063596 (analog for 6^k), A063606 (analog for 7^k).

a = {}; Do[k = 0; While[ Count[ IntegerDigits[8^k], 0] != n, k++ ]; a = Append[a, k], {n, 0, 50} ]; a

A063616(n)=for(k=0, oo, #select(d->!d, digits(8^k))==n&&return(k)) \\ M. F. Hasler, Jun 14 2018

a(0) changed to 0 (as in A031146, A063555, ...) and better title from M. F. Hasler, Jun 14 2018

A063626 Smallest k >= 0 such that 9^k has exactly n 0's in its decimal representation.

Original entry on oeis.org

0, 5, 11, 41, 33, 38, 42, 27, 60, 71, 63, 85, 94, 139, 96, 127, 157, 166, 131, 160, 170, 148, 190, 210, 212, 203, 221, 222, 218, 257, 223, 243, 250, 275, 302, 255, 273, 271, 333, 372, 270, 339, 371, 457, 408, 347, 402, 410, 483, 448, 355

Offset: 0

Robert G. Wilson v, Aug 10 2001

Cf. A031146 (analog for 2^k), A063555 (for 3^k), A063575 (for 4^k), A063585 (for 5^k), A063596 (for 6^k), A063606 (for 7^k), A063616 (for 8^k).

a = {}; Do[k = 0; While[ Count[ IntegerDigits[9^k], 0] != n, k++ ]; a = Append[a, k], {n, 0, 50} ]; a

A063626(n)=for(k=0, oo, #select(d->!d, digits(9^k))==n&&return(k)) \\ M. F. Hasler, Jun 15 2018

a(0) changed to 0 (as in A031146, A063555, ...) and better title from M. F. Hasler, Jun 15 2018

A305928 Irregular table: row n >= 0 lists all k >= 0 such that the decimal representation of 8^k has n digits '0' (conjectured).

Original entry on oeis.org

0, 1, 2, 3, 5, 6, 8, 9, 11, 12, 13, 17, 24, 27, 4, 7, 10, 15, 16, 19, 22, 25, 28, 32, 43, 14, 18, 20, 21, 26, 36, 37, 39, 45, 47, 49, 50, 55, 57, 77, 23, 29, 30, 31, 38, 41, 44, 51, 52, 58, 61, 42, 53, 59, 62, 65, 69, 33, 40, 48, 56, 60, 64, 73, 76, 80, 86, 114, 119, 35, 46

Offset: 0

M. F. Hasler, Jun 19 2018

The set of (nonempty) rows forms a partition of the nonnegative integers.
Read as a flattened sequence, a permutation of the nonnegative integers.
In the same way, another choice of (basis, digit, base) = (m, d, b) different from (8, 0, 10) will yield a similar partition of the nonnegative integers, trivial if m is a multiple of b.
It remains an open problem to provide a proof that the rows are complete, in the same way as each of the terms of A020665 is unproved.
We can also decide that the rows are to be truncated as soon as no term is found within a sufficiently large search limit. (For all of the displayed rows, there is no additional term up to many orders of magnitude beyond the last term.) That way the rows are well-defined, but it is no longer guaranteed to have a partition of the integers.

			The table reads:
n \ k's
0 : 0, 1, 2, 3, 5, 6, 8, 9, 11, 12, 13, 17, 24, 27 (= A030704)
1 : 4, 7, 10, 15, 16, 19, 22, 25, 28, 32, 43
2 : 14, 18, 20, 21, 26, 36, 37, 39, 45, 47, 49, 50, 55, 57, 77
3 : 23, 29, 30, 31, 38, 41, 44, 51, 52, 58, 61
4 : 42, 53, 59, 62, 65, 69
5 : 33, 40, 48, 56, 60, 64, 73, 76, 80, 86, 114, 119
...
Column 0 is A063596: least k such that 8^k has n digits '0' in base 10.
Row lengths are 14, 11, 15, 11, 6, 12, 10, 7, 14, 21, 9, 9, 15, 8, 6, 10, 8, 13, ... (not in the OEIS).
The inverse permutation is (0, 1, 2, 3, 14, 4, 5, 15, 6, 7, 16, 8, 9, 10, 25, 17, 18, 11, 26, 19, 27, 28, 20, 40, 12, 21, 29, 13, 22, ...), also not in the OEIS.

M. F. Hasler, Zeroless powers.. OEIS Wiki, March 2014

Cf. A030704, A063596.

Cf. A305932 (analog for 2^k), A305933 (analog for 3^k), A305924 (analog for 4^k), ..., A305929 (analog for 9^k).

mx = 1000; g[n_] := g[n] = DigitCount[8^n, 10, 0]; f[n_] := Select[Range@mx, g@# == n &]; Table[f@n, {n, 0, 4}] // Flatten (* Robert G. Wilson v, Jun 20 2018 *)

apply( A305928_row(n,M=50*(n+1))=select(k->#select(d->!d,digits(8^k))==n,[0..M]), [0..7])

Row n consists of integers in row n of A305932 divided by 3.

A305946 Number of powers of 6 having exactly n digits '0' (in base 10), conjectured.

Original entry on oeis.org

14, 10, 17, 16, 11, 14, 10, 8, 12, 19, 9, 16, 13, 11, 10, 10, 11, 10, 10, 17, 7, 15, 14, 16, 13, 22, 12, 17, 15, 17, 7, 6, 14, 22, 13, 19, 14, 12, 15, 7, 11, 14, 6, 12, 9, 12, 9, 14, 13, 15, 21

Offset: 0

M. F. Hasler, Jun 22 2018

a(0) = 14 is the number of terms in A030702 and in A195948, which includes the power 6^0 = 1.

These are the row lengths of A305926. It remains an open problem to provide a proof that these rows are complete (as for all terms of A020665), but the search has been pushed to many orders of magnitude beyond the largest known term, and the probability of finding an additional term is vanishing, cf. Khovanova link.

M. F. Hasler, Zeroless powers, OEIS Wiki, March 2014, updated 2018.
T. Khovanova, The 86-conjecture, Tanya Khovanova's Math Blog, Feb. 2011.
W. Schneider, No Zeros, 2000, updated 2003. (On web.archive.org--see A007496 for a cached copy.)

Cf. A030702 = row 0 of A305926: k such that 6^k has no 0's; A238936: these powers 6^k.
Cf. A020665: largest k such that n^k has no '0's.
Cf. A063596 = column 1 of A305926: least k such that 6^k has n digits '0' in base 10.
Cf. A305942 (analog for 2^k), ..., A305947, A305938, A305939 (analog for 9^k).

A305946(n,M=99*n+199)=sum(k=0,M,#select(d->!d,digits(6^k))==n)

A305946_vec(nMax,M=99*nMax+199,a=vector(nMax+=2))={for(k=0,M,a[min(1+#select(d->!d,digits(6^k)),nMax)]++);a[^-1]}

A305926 Irregular table: row n >= 0 lists all k >= 0 such that the decimal representation of 6^k has n digits '0' (conjectured).

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 12, 17, 24, 29, 44, 10, 11, 14, 15, 18, 22, 28, 40, 42, 59, 9, 16, 20, 21, 26, 30, 31, 33, 37, 38, 39, 45, 46, 49, 51, 53, 63, 13, 23, 25, 27, 32, 34, 35, 36, 47, 48, 54, 61, 72, 73, 76, 82, 19, 52, 60, 64, 65, 70, 71, 83, 91, 93, 98, 43, 50

Offset: 0

M. F. Hasler, Jun 19 2018

The set of (nonempty) rows forms a partition of the nonnegative integers.
Read as a flattened sequence, a permutation of the nonnegative integers.
In the same way, another choice of (basis, digit, base) = (m, d, b) different from (6, 0, 10) will yield a similar partition of the nonnegative integers, trivial if m is a multiple of b.
It remains an open problem to provide a proof that the rows are complete, in the same way as each of the terms of A020665 is unproved.
We can also decide that the rows are to be truncated as soon as no term is found within a sufficiently large search limit. (For all of the displayed rows, there is no additional term up to many orders of magnitude beyond the last term.) That way the rows are well-defined, but it is no longer guaranteed to have a partition of the integers.
The author finds this sequence "nice", i.e., appealing (as well as, e.g., the variant A305933 for basis 3) in view of the idea of partitioning the integers in such an elementary yet highly nontrivial way, and the remarkable fact that the rows are just roughly one line long. Will this property remain for large n, or else, how will the row lengths evolve?

			The table reads:
n \ k's
0 : 0, 1, 2, 3, 4, 5, 6, 7, 8, 12, 17, 24, 29, 44 (= A030702)
1 : 10, 11, 14, 15, 18, 22, 28, 40, 42, 59
2 : 9, 16, 20, 21, 26, 30, 31, 33, 37, 38, 39, 45, 46, 49, 51, 53, 63
3 : 13, 23, 25, 27, 32, 34, 35, 36, 47, 48, 54, 61, 72, 73, 76, 82
4 : 19, 52, 60, 64, 65, 70, 71, 83, 91, 93, 98
5 : 43, 50, 55, 58, 62, 66, 67, 75, 77, 78, 101, 106, 129, 134
...
Column 0 is A063596: least k such that 6^k has n digits '0' in base 10.
Row lengths are 14, 10, 17, 16, 11, 14, 10, 8, 12, 19, 9, 16, 13, 11, 10, 10, 11, 10, 10, 17, ... (A305946).
Last terms of the rows yield (44, 59, 63, 82, 98, 134, 108, 123, 199, 189, 192, 200, 275, 282, 267, 307, 298, 296, 391, 338, ...), A306116.
The inverse permutation is (0, 1, 2, 3, 4, 5, 6, 7, 8, 24, 14, 15, 9, 41, 16, 17, 25, 10, 18, 57, 26, 27, 19, 42, 11, 43, 28, 44, 20, 12, 29, 30, ...), not in OEIS.

M. F. Hasler, Zeroless powers.. OEIS Wiki, March 2014.

Cf. A030702, A063596.

Cf. A305932 (analog for 2^k), A305933 (analog for 3^k), A305924 (analog for 4^k), ..., A305929 (analog for 9^k).

mx = 1000; g[n_] := g[n] = DigitCount[6^n, 10, 0]; f[n_] := Select[Range@mx, g@# == n &]; Table[f@n, {n, 0, 4}] // Flatten (* Robert G. Wilson v, Jun 20 2018 *)

apply( A305926_row(n,M=50*(n+1))=select(k->#select(d->!d,digits(6^k))==n,[0..M]), [0..19])

A306116 Largest k such that 6^k has exactly n digits 0 (in base 10), conjectured.

Original entry on oeis.org

44, 59, 63, 82, 98, 134, 108, 123, 199, 189, 192, 200, 275, 282, 267, 307, 298, 296, 391, 338, 340, 396, 328, 436, 432, 478, 484, 615, 428, 529, 492, 515, 536, 523, 627, 665, 559, 592, 637, 560, 654, 674, 590, 653, 728, 791, 753, 781, 812, 783, 788

Offset: 0

M. F. Hasler, Jun 22 2018

a(0) is the largest term in A030702: exponents of powers of 6 without digit 0 in base 10.

There is no proof for any of the terms, just as for any term of A020665 and many similar / related sequences. However, the search has been pushed to many magnitudes beyond the largest known term, and the probability of any of the terms being wrong is extremely small, cf., e.g., the Khovanova link.

M. F. Hasler, Zeroless powers, OEIS Wiki, March 2014, updated 2018.
T. Khovanova, The 86-conjecture, Tanya Khovanova's Math Blog, Feb. 2011.
W. Schneider, No Zeros, 2000, updated 2003. (On web.archive.org--see A007496 for a cached copy.)

Cf. A063596: least k such that 6^k has n digits 0 in base 10.
Cf. A305946: number of k's such that 6^k has n digits 0.
Cf. A305926: row n lists exponents of 6^k with n digits 0.
Cf. A030702: { k | 6^k has no digit 0 } : row 0 of the above.
Cf. A238936: { 6^k having no digit 0 }.
Cf. A020665: largest k such that n^k has no digit 0 in base 10.
Cf. A071531: least k such that n^k contains a digit 0 in base 10.
Cf. A103663: least x such that x^n has no digit 0 in base 10.
Cf. A306112, ..., A306119: analog for 2^k, ..., 9^k.

A306116_vec(nMax,M=99*nMax+199,x=6,a=vector(nMax+=2))={for(k=0,M,a[min(1+#select(d->!d,digits(x^k)),nMax)]=k);a[^-1]}

cp's OEIS Frontend

A031146 Exponent of the least power of 2 having exactly n zeros in its decimal representation.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A063575 Smallest k such that 4^k has exactly n 0's in its decimal representation.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Extensions

A063585 Least k >= 0 such that 5^k has exactly n 0's in its decimal representation.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Extensions

A063606 Smallest k >= 0 such that 7^k has exactly n 0's in its decimal representation.

Views

Author

Keywords

Crossrefs

Programs

Mathematica

PARI

A063616 Smallest k >= 0 such that 8^k has exactly n 0's in its decimal representation.

Views

Author

Keywords

Crossrefs

Programs

Mathematica

PARI

Extensions

A063626 Smallest k >= 0 such that 9^k has exactly n 0's in its decimal representation.

Views

Author

Keywords

Crossrefs

Programs

Mathematica

PARI

Extensions

A305928 Irregular table: row n >= 0 lists all k >= 0 such that the decimal representation of 8^k has n digits '0' (conjectured).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A305946 Number of powers of 6 having exactly n digits '0' (in base 10), conjectured.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs