login
This site is supported by donations 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

Table of n, a(n) for n=0..6.

CROSSREFS

Cf. A035930-A035934.

Sequence in context: A035934 A035932 A035933 * A193107 A084584 A188089

Adjacent sequences:  A035932 A035933 A035934 * A035936 A035937 A035938

KEYWORD

nonn,base,nice

AUTHOR

Erich Friedman

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 November 18 17:57 EST 2019. Contains 329288 sequences. (Running on oeis4.)