This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080063 n mod (spf(n)+1), where spf(n) is the smallest prime dividing n (A020639). 2
 1, 2, 3, 1, 5, 0, 7, 2, 1, 1, 11, 0, 13, 2, 3, 1, 17, 0, 19, 2, 1, 1, 23, 0, 1, 2, 3, 1, 29, 0, 31, 2, 1, 1, 5, 0, 37, 2, 3, 1, 41, 0, 43, 2, 1, 1, 47, 0, 1, 2, 3, 1, 53, 0, 1, 2, 1, 1, 59, 0, 61, 2, 3, 1, 5, 0, 67, 2, 1, 1, 71, 0, 73, 2, 3, 1, 5, 0, 79, 2, 1, 1, 83, 0, 1, 2, 3, 1, 89, 0, 3, 2, 1, 1, 5, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) = 0 iff n mod 6 = 0 (A008588); a(n) = 2 iff n mod 6 = 2 (A016933); for n>1: a(n)=n iff n is prime (A000040, A008578). LINKS CROSSREFS Cf. A080064, A080065, A010872, A010873, A010875, A010877, A010881. Sequence in context: A125182 A169625 A201737 * A187680 A140706 A200068 Adjacent sequences:  A080060 A080061 A080062 * A080064 A080065 A080066 KEYWORD nonn AUTHOR Reinhard Zumkeller, Jan 24 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .