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”).

A018205
Let m=n+1; a(n) is the least positive integer s, not a multiple of m, such that if 1<=d<=m and (d,m)=1, then d divides one of the numbers s-m, s-2m, ..., s-m[ s/m ].
0
3, 5, 7, 13, 11, 19, 23, 34, 37, 51, 47, 76, 69, 71, 93, 147, 106, 184, 137, 164, 192, 275, 167, 313, 251, 316, 303, 365, 329, 553, 317, 458, 563, 548, 427, 697, 563, 739, 591, 940, 617, 1051, 747, 712, 1003, 1251, 761, 1219
OFFSET
1,1
PROG
(PARI) a(n) = {m = n+1; s = m; while (1, sok = 1; if (s % m, for (d=1, m, if (gcd(d, m) == 1, ndok = 0; for (k=1, floor(s/m), if (((s-k*m) % d) == 0, ndok = 1; break; ); ); ); if (! ndok, sok = 0; break; ); ); if (sok, return(s)); ); s++; ); } \\ Michel Marcus, Mar 22 2013
CROSSREFS
Sequence in context: A111745 A098957 A143245 * A370762 A121047 A152075
KEYWORD
nonn
EXTENSIONS
More terms from Michel Marcus, Mar 22 2013
STATUS
approved