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

%I

%S 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,

%T 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,

%U 11,12,11,11,14,12,11,2,11,12,11,11,13,11,13,13,18

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

%H Reinhard Zumkeller, <a href="/A236046/b236046.txt">Table of n, a(n) for n = 2..5000</a>

%o (Haskell)

%o import Data.List (isInfixOf)

%o a236046 n = head [x | x <- [2..], not $ show x `isInfixOf` (show $ x ^ n)]

%Y Cf. A235052.

%K nonn,base

%O 2,1

%A _Reinhard Zumkeller_, Jan 18 2014

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 September 25 13:01 EDT 2020. Contains 337344 sequences. (Running on oeis4.)