id:A035931 - OEIS Search Results

Search: id:A035931

Displaying 1-1 of 1 results found.

page 1

Number of steps to reach 0 under "k->max product of two numbers whose concatenation is k".

+0
2

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; listen)

	OFFSET	`0,12`
	EXAMPLE	`a(123)=5 since 341->123->36->18->8->0`
	CROSSREFS	`Cf. A035930-A035935.` `Sequence in context: A055640 A098378 A160093 this_sequence A140438 A132211 A067441` `Adjacent sequences: A035928 A035929 A035930 this_sequence A035932 A035933 A035934`
	KEYWORD	`nonn,base,nice`
	AUTHOR	`Erich Friedman (erich.friedman(AT)stetson.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research