Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A035932
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A035932 Smallest number which takes n steps to reach 0 under "k->max product of 2 numbers whose concatenation is k". +0
1
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; listen)
OFFSET

0,3

CROSSREFS

Cf. A035930-A035935.

Sequence in context: A137015 A002154 A035934 this_sequence A035933 A035935 A084584

Adjacent sequences: A035929 A035930 A035931 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research