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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035931 Number of steps to reach 0 under "k->max product of two numbers whose concatenation is k". 1
0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 1, 2, 2, 2, 3, 3, 3, 3, 3, 4, 1, 2, 2, 3, 3, 2, 3, 4, 3, 4, 1, 2, 2, 3, 2, 3, 2, 4, 2, 3, 1, 2, 3, 3, 3, 2, 4, 3, 4, 3, 1, 2, 3, 3, 4, 4, 3, 5, 3, 4, 1, 2, 3, 3, 3, 2, 4, 3, 4, 4, 1, 2, 3, 4, 4, 3, 3, 4, 4, 3, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,12

LINKS

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

EXAMPLE

a(123)=5 since 341->123->36->18->8->0

CROSSREFS

Cf. A035930-A035935.

Sequence in context: A055640 A098378 A160093 * A140438 A132211 A067441

Adjacent sequences:  A035928 A035929 A035930 * A035932 A035933 A035934

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 | 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 June 18 17:38 EDT 2013. Contains 226355 sequences.