login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035932 Smallest number which takes n steps to reach 0 under "k->max product of 2 numbers whose concatenation is k". 0
0, 1, 11, 26, 39, 77, 117, 139, 449, 529, 777, 1117, 2229, 2982, 4267, 4779, 5319, 5919, 8693, 12699, 14119, 17907, 27779, 47877, 80299, 103199, 135199, 274834, 293938, 312794, 606963, 653993, 773989, 1160892, 1296741, 1616696, 1986576 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

CROSSREFS

Cf. A035930-A035935.

Sequence in context: A190684 A002154 A035934 * A035933 A035935 A193107

Adjacent sequences:  A035929 A035930 A035931 * A035933 A035934 A035935

KEYWORD

nonn,base,nice

AUTHOR

Erich Friedman (erich.friedman(AT)stetson.edu)

EXTENSIONS

More terms from Naohiro Nomoto (6284968128(AT)geocities.co.jp), Apr 03 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 16 10:53 EST 2012. Contains 205904 sequences.