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-2 of 2 results.

A346497 List of powers of 2 written in base 3 which contain no zero digits.

Original entry on oeis.org

1, 2, 11, 22, 121, 1122221122
Offset: 1

Views

Author

Rafael Castro Couto, Jul 20 2021

Keywords

Comments

The listed terms are the base-3 expansions of 1, 2, 4, 8, 16, and 32768.
The program shows that there are no other terms less than 2^1000.
a(7) > 2^(10^7). - Martin Ehrenstein, Jul 27 2021
If it exists, a(7) > 2^(10^21). - Robert Saye, Mar 23 2022

References

  • David Wells, "The Penguin Dictionary of Curious and Interesting Numbers" (1997), p. 123.

Crossrefs

Cf. A102483, A004642 (all powers of 2 in base 3), A104320 (number of zeros in ternary representation of 2^n), A130693 (same problem in base 10).

Programs

  • Mathematica
    pwr = 1; Do[pwr = Mod[2*pwr, 3^100]; d = Union[IntegerDigits[pwr, 3]]; If[Intersection[d, {0}] == {}, Print[IntegerString[pwr, 3]]], {n, 10000000}] (* Ricardo Bittencourt, Jul 07 2021 *)
    Select[Table[FromDigits[IntegerDigits[2^n,3]],{n,0,100}],DigitCount[#,10,0]==0&] (* Harvey P. Dale, Feb 18 2025 *)

Formula

a(n) = A007089(2^A102483(n)). - Michel Marcus, Jul 23 2021

A139126 Least k such that the last n decimal digits of 2^k are all powers of 2.

Original entry on oeis.org

0, 7, 7, 18, 19, 90, 91, 271, 1751, 18807, 56589, 56589, 56589, 56589, 899791, 899791, 2814790, 7635171, 7635171, 39727671, 99530619, 233093807, 233093807, 233093807, 233093807
Offset: 1

Views

Author

T. D. Noe, Apr 08 2008

Keywords

Comments

Does k exist for all n? This sequence is inspired by A130693, which lists all known powers of 2 whose digits are all powers of 2 (that is, 1, 2, 4, or 8).

Examples

			2^19=524288 is the least power of 2 ending with 5 digits that are powers of 2.
		

Programs

  • Mathematica
    k=1; Join[{0}, Table[k--; pwr=PowerMod[2,k,10^n]; While[k++; pwr=Mod[2*pwr,10^n]; d=Union[IntegerDigits[pwr,10,n]]; Intersection[d,{3,5,6,7,9,0}]!={}]; k, {n,2,10}]]
Showing 1-2 of 2 results.