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!)
A245726 The digit occurring n times in A225842. 1

%I #12 Aug 02 2014 06:44:18

%S 0,1,5,7,7,2,4,7,9,7,0,3,6,6,1,2,4,4,8,8,0,8,8,0,9,1,8,8,6,8,0,8,5,6,

%T 9,5,9,7,9,9,0,1,0,3,1,3,8,3,7,6,0,5,0,6,6,1,7,7,4,5,0,8,6,4,9,1,0,1,

%U 2,0,0,1,4,6,4,2,6,5,1,7,0,9,2,7,3,1,8,1,7,7,0,4,1,1,0,9,1

%N The digit occurring n times in A225842.

%C The digit occurring n times in a smaller power of n than any other digit. In case of a tie the smallest digit is chosen. For example, a(2) = 5 for 2^16 = 65536. - _Jens Kruse Andersen_, Aug 01 2014

%H Jens Kruse Andersen, <a href="/A245726/b245726.txt">Table of n, a(n) for n = 0..1000</a>

%o (Python)

%o def a(n):

%o ..b = '0123456789'

%o ..for k in range(10**4):

%o ....s = str(n**k)

%o ....for i in b:

%o ......if s.count(i) >= n:

%o ........return int(i)

%o n = 0

%o while n < 150:

%o ..print(a(n),end=', ')

%o ..n += 1

%Y Cf. A225842.

%K nonn,base

%O 0,3

%A _Derek Orr_, Jul 30 2014

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 23 10:29 EDT 2024. Contains 371905 sequences. (Running on oeis4.)