A066069 a(n) is the smallest positive integer m such that n divides (n + m)^m.

1, 2, 3, 2, 5, 6, 7, 4, 3, 10, 11, 6, 13, 14, 15, 4, 17, 6, 19, 10, 21, 22, 23, 6, 5, 26, 3, 14, 29, 30, 31, 4, 33, 34, 35, 6, 37, 38, 39, 10, 41, 42, 43, 22, 15, 46, 47, 6, 7, 10, 51, 26, 53, 6, 55, 14, 57, 58, 59, 30, 61, 62, 21, 4, 65, 66, 67, 34, 69, 70, 71, 6, 73, 74, 15, 38

Offset

1,2

Comments

Essentially the same as A019530. - R. J. Mathar, Sep 30 2008

Links

Harry J. Smith, Table of n, a(n) for n = 1..1000

Example

a(8) = 4 because (8+1)^1 mod 8 = 1, (8+2)^2 mod 8 = 4, (8+3)^3 mod 8 = 3 and (8+4)^4 mod 8 = 0.

Prog

(PARI) { for (n=1, 1000, m=1; while ((n+m)^m % n, m++); write("b066069.txt", n, " ", m) ) } \\ Harry J. Smith, Nov 09 2009

Crossrefs

First 23 terms are the same as A019554.

Sequence in context: A304491 A277803 A062789 * A019530 A355263 A019554

Adjacent sequences: A066066 A066067 A066068 * A066070 A066071 A066072

Keyword

nonn

Author

Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Dec 02 2001

Status

approved