The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A083218 a(n) = n mod (spf(n+1)+1), where spf(n) is the smallest prime factor of n (A020639). 3
 1, 2, 0, 4, 2, 6, 1, 0, 0, 10, 2, 12, 1, 2, 0, 16, 2, 18, 1, 0, 0, 22, 2, 0, 1, 2, 0, 28, 2, 30, 1, 0, 0, 4, 2, 36, 1, 2, 0, 40, 2, 42, 1, 0, 0, 46, 2, 0, 1, 2, 0, 52, 2, 0, 1, 0, 0, 58, 2, 60, 1, 2, 0, 4, 2, 66, 1, 0, 0, 70, 2, 72, 1, 2, 0, 4, 2, 78, 1, 0, 0, 82, 2, 0, 1, 2, 0, 88, 2, 2, 1, 0, 0, 4, 2, 96 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) = n iff n+1 is prime: a(A006093(k))=A006093(k). LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 MATHEMATICA Table[Mod[n, FactorInteger[n+1][[1, 1]]+1], {n, 100}] (* Harvey P. Dale, May 28 2013 *) CROSSREFS Cf. A057237. Sequence in context: A097945 A319997 A153733 * A203908 A334082 A307704 Adjacent sequences:  A083215 A083216 A083217 * A083219 A083220 A083221 KEYWORD nonn AUTHOR Reinhard Zumkeller, Apr 22 2003 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.

Last modified August 11 01:53 EDT 2020. Contains 336418 sequences. (Running on oeis4.)