|
|
A035935
|
|
Smallest number that always takes at least n steps to reach 0 under "k -> any product of 2 numbers whose concatenation is k".
|
|
5
|
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Next term is at least 3*10^7. 666 may be the last term. - Naohiro Nomoto, Apr 07 2001
Checked up to 1.55*10^10. No other numbers apart 666 with minimal path of length 6. The largest number found with minimal path equal to 5 is 711111. - Giovanni Resta, Oct 03 2012
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|