Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A035935
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
6
0, 1, 11, 26, 39, 77, 666 (list; graph; listen)
OFFSET

0,3

CROSSREFS

Cf. A035930-A035934.

Sequence in context: A035934 A035932 A035933 this_sequence A084584 A003345 A047722

Adjacent sequences: A035932 A035933 A035934 this_sequence 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

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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research