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!)
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
0, 1, 11, 26, 39, 77, 666 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A035934 A035932 A035933 * A193107 A084584 A188089
KEYWORD
nonn,base,nice
AUTHOR
STATUS
approved

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 24 07:35 EDT 2024. Contains 371922 sequences. (Running on oeis4.)