login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A138262 Smallest positive integer m such that n divides [9^m/m] (=A129799(m)). 8
1, 2, 1, 2, 2, 11, 5, 2, 1, 2, 10, 11, 19, 13, 11, 11, 7, 11, 28, 2, 13, 10, 6, 11, 11, 19, 3, 13, 15, 11, 61, 13, 11, 8, 13, 11, 19, 28, 19, 2, 4, 13, 60, 10, 11, 12, 24, 11, 5, 11, 41, 19, 79, 82, 10, 13, 28, 15, 233, 11, 10, 61, 13, 17, 19, 11, 12, 8, 12, 13, 36, 11, 13, 19, 11, 37 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
This sequence is well-defined.
LINKS
Romanian Master in Mathematics Contest, Problem 3, Bucharest, 2007.
MATHEMATICA
spi[n_]:=Module[{m=1}, While[Mod[Floor[9^m/m], n]!=0, m++]; m]; Array[spi, 80] (* Harvey P. Dale, Jul 07 2022 *)
CROSSREFS
Sequence in context: A110775 A229232 A092186 * A276990 A127510 A328362
KEYWORD
nonn
AUTHOR
Max Alekseyev, Mar 09 2008.
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 24 22:37 EDT 2024. Contains 374585 sequences. (Running on oeis4.)