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!)
A243152 a(n) = the digit that is repeated exactly n times in the string A243151(n)^n. 0
1, 1, 6, 3, 9, 4, 1, 1, 6, 0, 8, 5, 4, 8, 7, 1, 4, 1, 6, 0, 6, 3, 8, 9, 3, 4, 9, 6, 7, 6, 7, 4, 6, 0, 3, 9, 6, 0, 9, 5, 1, 3, 1, 6, 2, 7, 7, 9, 4, 8, 9, 2, 7, 7, 7, 9, 9, 4, 9, 9, 1, 0, 9, 5, 9, 5, 5, 6, 4, 3, 2, 6, 3, 7, 4, 7, 2, 0, 1, 2, 8, 1, 9, 6, 9, 9, 1, 9, 3, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

In the event of a tie, choose the smaller integer.

LINKS

Table of n, a(n) for n=1..90.

EXAMPLE

A243151(2) = 11. So A243151(2)^2 = 121. Since the digit 1 is the one repeated two times, a(2) = 1.

PROG

(Python)

def c(n):

..for k in range(10**7):

....if k % 10 == 0:

......lst = []

......count = 0

......for i in range(10):

........if str(k**n).count(str(i)) == n:

..........return i

n = 1

while n < 100:

..print(c(n), end=', ')

..n+=1

CROSSREFS

Cf. A243151.

Sequence in context: A158606 A021065 A262041 * A093754 A135935 A263183

Adjacent sequences:  A243149 A243150 A243151 * A243153 A243154 A243155

KEYWORD

nonn,base

AUTHOR

Derek Orr, May 31 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 September 27 03:21 EDT 2020. Contains 337380 sequences. (Running on oeis4.)