A138259 Smallest positive integer m such that n divides [6^m/m] (=A129796(m)).

1, 1, 1, 3, 5, 1, 11, 3, 2, 7, 21, 3, 20, 11, 7, 6, 40, 2, 10, 219, 11, 21, 20, 3, 11, 20, 4, 119, 15, 7, 7, 6, 31, 40, 11, 3, 13, 37, 33, 219, 42, 11, 7, 130, 38, 20, 33, 6, 15, 11, 57, 20, 79, 4, 21, 119, 10, 15, 60, 219, 62, 7, 38, 9, 37, 31, 50, 259, 49, 11, 211, 3, 37, 13, 11, 219

Offset: 1

Author

Max Alekseyev, Mar 09 2008

Keywords

• nonn

Comments

This sequence is well-defined.

Links

• Romanian Master in Mathematics Contest, Problem 3, Bucharest, 2007.

Crossrefs

Cf. A129796, A138255, A138256, A138257, A138258, A138260, A138261, A138262, A138263.

Programs

Mathematica

a[n_]:=Module[{m=1},While[!Divisible[Floor[6^m/m],n],m++];m];Array[a,76] (* James C. McMahon, Jun 05 2025 *)