|
|
A138256
|
|
Smallest positive integer m such that n divides [3^m/m] (=A092763(m)).
|
|
8
|
|
|
1, 2, 1, 2, 4, 5, 13, 5, 3, 4, 6, 5, 7, 13, 13, 5, 16, 10, 15, 4, 13, 11, 15, 5, 22, 7, 9, 13, 30, 13, 33, 17, 11, 16, 13, 10, 19, 37, 7, 13, 8, 13, 55, 11, 14, 67, 35, 5, 43, 22, 82, 7, 108, 92, 20, 13, 37, 30, 120, 13, 11, 33, 26, 17, 14, 11, 23, 16, 24, 13, 72, 10, 13, 19, 22, 37
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence is well-defined.
|
|
LINKS
|
Romanian Master in Mathematics Contest, Bucharest, 2007, Problem 3
|
|
MATHEMATICA
|
pim[n_]:=Module[{m=1}, While[!Divisible[Floor[3^m/m], n], m++]; m]; Array[pim, 80] (* Harvey P. Dale, Oct 26 2011 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|