[go: up one dir, main page]

login
Revision History for A090493 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

newer changes | Showing entries 11-20 | older changes
Least k such that n^k contains all the digits from 0 through 9, or 0 if no such k exists.
(history; published version)
#57 by Seiichi Manyama at Wed Apr 08 07:16:41 EDT 2020
STATUS

editing

proposed

#56 by Seiichi Manyama at Wed Apr 08 07:14:39 EDT 2020
CROSSREFS

Exponents of powers of k that contain all ten decimal digits: A130694 (k=2), A236673 (k=3), A284670 (k=5), A284672 (k=7).

#55 by Seiichi Manyama at Wed Apr 08 07:13:44 EDT 2020
CROSSREFS

Exponents of powers of k that contain all ten decimal digits: A130694 (k=2), A236673 (k=3).

#54 by Seiichi Manyama at Wed Apr 08 07:12:48 EDT 2020
CROSSREFS

Exponents of powers of k that contain all ten decimal digits: A236673 (k=3).

#53 by Seiichi Manyama at Wed Apr 08 07:10:53 EDT 2020
LINKS

Seiichi Manyama, <a href="/A090493/b090493_1.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from T. D. Noe)

#52 by Seiichi Manyama at Wed Apr 08 07:07:01 EDT 2020
LINKS

T. D. Noe, Seiichi Manyama, <a href="/A090493/b090493_1.txt">Table of n, a(n) for n = 1..100010000</a>

STATUS

approved

editing

#51 by Joerg Arndt at Sat Dec 15 13:18:21 EST 2018
PROG

(Python2.7)

def A320572(n):

if not(10 ** int(round(math.log(n, 10), 0)) == n):

set = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

a=0

while set:

a=a+1

m=int(math.pow(n, a))

m_set=map(int, str(m))

for x in m_set:

if x in set:

set.remove(x)

return a

else:

return 0

# Benjamin Knight, Nov 20 2018

STATUS

proposed

approved

#50 by Benjamin Knight at Tue Nov 20 13:41:00 EST 2018
STATUS

editing

proposed

Discussion
Sat Dec 15
13:18
Joerg Arndt: pow and log for operations on digits is silly, reverting.
#49 by Benjamin Knight at Tue Nov 20 13:40:58 EST 2018
STATUS

proposed

editing

#48 by Benjamin Knight at Tue Nov 20 13:40:03 EST 2018
STATUS

editing

proposed