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!)
A051248 n^a(n) is the smallest power of n (with a(n) > 1) which starts with n. 10

%I #28 Oct 08 2023 04:53:18

%S 2,8,18,6,24,10,20,11,22,2,26,14,10,8,92,6,166,5,19,11,60,39,48,51,94,

%T 42,467,86,14,66,58,3,5268,33,58,10,45,70,23,6,205,70,31,15,50,84,248,

%U 70,72,94,107,170,30,10139,182,136,87,318,49,10,178,237,295,99,17,206

%N n^a(n) is the smallest power of n (with a(n) > 1) which starts with n.

%C A070327(n) = n^a(n) for n > 1. - _Reinhard Zumkeller_, Sep 29 2011

%C The largest of the first 10000 terms is a(1955) = 119589011. - _Giovanni Resta_, May 27 2016

%H Giovanni Resta, <a href="/A051248/b051248.txt">Table of n, a(n) for n = 1..10000</a> (first 275 terms from Reinhard Zumkeller)

%e 2^8 = 256 begins with 2, and 2^k does not begin with 2 for any smaller integer k > 1, so a(2) = 8.

%t f[n_]:=Module[{i=2},While[Take[IntegerDigits[n^i],IntegerLength[n]] != IntegerDigits[n],i++];i]; Array[f,70] (* _Harvey P. Dale_, Oct 04 2011 *)

%o (Haskell)

%o import Data.List (isPrefixOf)

%o a051248 n = 2 + length

%o (takeWhile (not . (show n `isPrefixOf`) . show) $ iterate (* n) (n^2))

%o -- _Reinhard Zumkeller_, Sep 29 2011

%Y Cf. A045537, A104782.

%K nonn,base,nice

%O 1,1

%A _Michel ten Voorde_

%E More terms from _Jud McCranie_

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 April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)