id:A101183 - OEIS Search Results

Search: id:A101183

Displaying 1-1 of 1 results found.

page 1

Number of times (>0) function f must be applied in A100800 to arrive at multiple of n, or 0 if multiple of n is never reached.

+0
3

1, 1, 1, 1, 1, 1, 1, 1, 1, 14, 32, 3, 12, 36, 3, 31, 10, 2, 71, 8, 8, 8, 11, 8, 67, 8, 3, 35, 35, 10, 31, 53, 22, 45, 38, 4, 59, 70, 44, 27, 27, 19, 44, 36, 5, 14, 47, 42, 33, 66, 16, 33, 42, 11, 105, 151, 5, 92, 69, 7, 7, 48, 6, 23, 20, 22, 7, 62, 22, 145, 7, 7, 20, 7, 58, 7, 184, 44 (list; graph; listen)

	OFFSET	`1,10`
	COMMENT	`Conjecture: No term is zero.`
	EXAMPLE	`a(10) = 14 since f has to be applied 14 times to 10 to arrive at 130, a multiple of 10.`
	CROSSREFS	`Cf. A100800, A100801.` `Sequence in context: A075208 A015222 A054103 this_sequence A101444 A084194 A031109` `Adjacent sequences: A101180 A101181 A101182 this_sequence A101184 A101185 A101186`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 19 2004`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research