A035935 - OEIS

This site is supported by donations to The OEIS Foundation.

A035935

Smallest number which always takes at least n steps to reach 0 under "k->any product of 2 numbers whose concatenation is k".

0, 1, 11, 26, 39, 77, 666 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,3`
	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 (erich.friedman(AT)stetson.edu)`
	EXTENSIONS	`Next term is at least 3*10^7. 666 may be the last term. - Naohiro Nomoto (6284968128(AT)geocities.co.jp), Apr 07 2001`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 02:31 EST 2012. Contains 205978 sequences.