|
|
A138260
|
|
Smallest positive integer m such that n divides [7^m/m] (=A129797(m)).
|
|
9
|
|
|
1, 2, 2, 2, 4, 2, 1, 2, 13, 4, 20, 2, 12, 11, 4, 11, 16, 13, 3, 4, 11, 20, 67, 2, 4, 12, 19, 11, 43, 4, 60, 13, 20, 16, 13, 13, 9, 3, 12, 4, 10, 11, 6, 20, 13, 67, 66, 11, 7, 4, 16, 12, 79, 19, 20, 11, 3, 43, 78, 4, 51, 60, 13, 17, 12, 20, 75, 16, 67, 13, 52, 13, 24, 9, 4, 6, 31, 12, 35
(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[7^m/m], n]!=0, m++]; m]; Array[spi, 80] (* Harvey P. Dale, Aug 16 2018 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|