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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101183 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. 2
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; refs; listen; history; internal format)
OFFSET

1,10

COMMENTS

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: A161454 A156203 A196135 * A101444 A084194 A031109

Adjacent sequences:  A101180 A101181 A101182 * A101184 A101185 A101186

KEYWORD

base,easy,nonn

AUTHOR

Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 19 2004

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 February 15 23:34 EST 2012. Contains 205860 sequences.