A138259 - OEIS

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

A138259

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

8

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

COMMENTS

This sequence is well-defined.

LINKS

Table of n, a(n) for n=1..76.

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

CROSSREFS

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

Sequence in context: A204029 A026253 A259182 * A077021 A344437 A143250

Adjacent sequences: A138256 A138257 A138258 * A138260 A138261 A138262

KEYWORD

nonn

AUTHOR

Max Alekseyev, Mar 09 2008.

STATUS

approved