login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A138258
Smallest positive integer m such that n divides [5^m/m] (=A129795(m)).
9
1, 2, 2, 2, 1, 2, 6, 7, 7, 7, 22, 2, 4, 6, 7, 13, 16, 7, 10, 7, 6, 31, 55, 7, 5, 4, 19, 6, 15, 7, 6, 17, 31, 16, 13, 7, 36, 10, 4, 7, 3, 6, 42, 31, 7, 55, 51, 13, 43, 26, 16, 4, 52, 19, 31, 13, 18, 15, 27, 7, 31, 6, 13, 17, 17, 31, 9, 16, 67, 13, 11, 7, 66, 36, 26, 18, 31, 4, 9, 13, 56, 61
OFFSET
1,2
COMMENTS
This sequence is well-defined.
LINKS
Romanian Master in Mathematics Contest, Problem 3, Bucharest, 2007.
MAPLE
N:= 100: # for a(1)..a(N)
V:= Vector(N):
count:= 0: missing:= {$1..N}:
Q:= ilcm(seq(i, i=1..N)):
for m from 1 while count < N do
v:= floor(5^m/m);
r:= igcd(v, Q);
d:= select(t -> r mod t = 0, missing);
missing:= missing minus d;
count:= count+nops(d);
V[convert(d, list)]:= m;
od:
convert(V, list); # Robert Israel, Aug 27 2020
KEYWORD
nonn
AUTHOR
Max Alekseyev, Mar 09 2008
STATUS
approved