%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
