reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
.. s = str(n)
.. if n == 1 or (s.count('0')==len(s)-1 and s.startswith('1')):
.... return 0
.. k = 1
.. count = 0
.. while count != 10:
.... count = 0
.... for i in range(10):
...... if str(n**k).count(str(i)) == 0:
........ count += 1
........ break
.... if count:
...... k += 1
.... else:
...... return k
.. print(a(n), end=', ')
.. n += 1
proposed
editing
editing
proposed
a(n) >= ceiling(log_n(10)*9), whenever a(n)>0. This is because in order for an integer to have 10 digits its base -10 magnitude must be at least 9. - Ely Golden, Sep 06 2017
proposed
editing
editing
proposed
a(n) >= ceiling(log_n(10)*9) , whenever a(where definedn)>0. This is because in order for an integer to have 10 digits its base 10 magnitude must be at least 9. - Ely Golden, Sep 06 2017
approved
editing
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)
proposed
approved