login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A236046 Smallest number m > 1 such that m^n does not contain m as a substring. 2
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 (list; graph; refs; listen; history; text; internal format)
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)]

CROSSREFS

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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 14 07:04 EDT 2020. Contains 336477 sequences. (Running on oeis4.)