cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A030702 Decimal expansion of 6^n contains no zeros (probably finite).

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 12, 17, 24, 29, 44
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Magma
    [n: n in [0..500] | not 0 in Intseq(6^n)]; // Vincenzo Librandi, Mar 08 2014
  • Mathematica
    Select[Range[50],FreeQ[IntegerDigits[6^#],0]&] (* Harvey P. Dale, Feb 26 2017 *)
  • PARI
    for(n=0, 199, vecmin(digits(6^n))&& print1(n", ")) \\ M. F. Hasler, Mar 07 2014
    

Extensions

Offset corrected and initial 0 added by M. F. Hasler, Mar 07 2014

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

Views

Author

M. F. Hasler, Jun 22 2018

Keywords

Comments

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.

Crossrefs

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).

Programs

  • PARI
    A305946(n,M=99*n+199)=sum(k=0,M,#select(d->!d,digits(6^k))==n)
    
  • PARI
    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]}

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

Views

Author

M. F. Hasler, Jun 22 2018

Keywords

Comments

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.

Crossrefs

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.

Programs

  • PARI
    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]}
Showing 1-3 of 3 results.