login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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". 4
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

Scott R. Shannon, Table of n, a(n) for n = 0..10000.

EXAMPLE

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

MATHEMATICA

f[n_] := If[n<10, 0, With[{d = IntegerDigits[n]}, Table[FromDigits[Take[d, k]]*FromDigits[Drop[d, k]], {k, 1, Length[d]-1}] // Max]];

a[n_] := If[n == 0, 0, Length[FixedPointList[f, n]]-2];

Table[a[n], {n, 0, 100}] (* Jean-Fran├žois Alcover, Apr 03 2017 *)

CROSSREFS

Cf. A035930, A035932, A035933, A035934, A035935.

Sequence in context: A098378 A160093 A259143 * A330634 A254524 A140438

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 | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 14 19:47 EDT 2020. Contains 336483 sequences. (Running on oeis4.)