login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

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 * A121047 A152075 A092789

Adjacent sequences:  A018202 A018203 A018204 * A018206 A018207 A018208

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

More terms from Michel Marcus, Mar 22 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 04:40 EDT 2019. Contains 328211 sequences. (Running on oeis4.)