The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275533 Least positive number m such that m^k for k = 1..n have no digit 1. 2
2, 2, 2, 74, 94, 305, 2975 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
It appears that there are no more terms in this sequence.
If they exist, a(8) > 127231981 and a(9) > 107895940. - J.W.L. (Jan) Eerland, Nov 26 2022
If they exist, a(8)-a(15) > 10^13 and a(16) > 10^32; a(17) and beyond do not exist. - Michael S. Branicky, Apr 05 2024
LINKS
FORMULA
a(n) <= a(n+1). - Michael S. Branicky, Apr 05 2024
EXAMPLE
2975^k, k = 1..7 = 2975, 8850625, 26330609375, 78333562890625, 233042349599609375, 693300990058837890625, 2062570445425042724609375 (all are oneless), while 2975^8 = 6136147075139502105712890625 has 5 ones.
MATHEMATICA
Table[{n, m=1; Monitor[Parallelize[While[True, If[Length[DeleteCases[Table[If[MemberQ[IntegerDigits[m^k], 1]==False, k, a], {k, 1, n}], a]]==n, Break[]]; m++]; m], m]}, {n, 1, 7}] (* J.W.L. (Jan) Eerland, Nov 26 2022 *)
PROG
(Python)
from itertools import count
def A275533(n): return next(m for m in count(1) if not any('1' in str(m**k) for k in range(1, n+1))) # Chai Wah Wu, Apr 04 2024
CROSSREFS
Cf. A052383 (numbers without 1 as a digit), A371706.
Sequence in context: A266713 A226745 A102384 * A304463 A066736 A324302
KEYWORD
nonn,base,more,fini
AUTHOR
Zak Seidov, Jul 31 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 21 01:24 EDT 2024. Contains 372720 sequences. (Running on oeis4.)