A236046 Smallest number m > 1 such that m^n does not contain m as a substring.

2, 2, 2, 11, 2, 3, 3, 11, 3, 3, 2, 11, 2, 11, 2, 11, 11, 3, 2, 14, 2, 2, 7, 11, 2, 3, 3, 11, 11, 12, 14, 11, 2, 2, 2, 11, 11, 2, 3, 14, 2, 13, 12, 11, 2, 11, 12, 11, 3, 14, 11, 11, 2, 3, 11, 11, 12, 11, 11, 14, 12, 11, 2, 11, 12, 11, 11, 13, 11, 13, 13, 18

Offset

2,1

Links

Reinhard Zumkeller, Table of n, a(n) for n = 2..5000

Prog

(Haskell)
import Data.List (isInfixOf)
a236046 n = head [x | x <- [2..], not $ show x `isInfixOf` (show $ x ^ n)]
(PARI) a(n) = my(k=2); while(#strsplit(Str(k^n), Str(k))!=1, k++); k; \\ Michel Marcus, Jan 25 2022

Crossrefs

Cf. A034293, A235052.

Sequence in context: A087628 A263060 A089871 * A289898 A068971 A019233

Adjacent sequences: A236043 A236044 A236045 * A236047 A236048 A236049

Keyword

nonn,base

Author

Reinhard Zumkeller, Jan 18 2014

Status

approved