This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A179656 prime(n) mod (digital root(prime(n))). 0
 0, 0, 0, 0, 1, 1, 1, 0, 3, 1, 3, 0, 1, 1, 1, 5, 4, 5, 3, 7, 0, 2, 1, 1, 6, 1, 3, 3, 0, 3, 0, 1, 1, 3, 4, 4, 1, 0, 2, 1, 3, 0, 1, 1, 5, 0, 3, 6, 1, 1, 1, 4, 3, 3, 2, 1, 5, 0, 4, 1, 3, 3, 0, 1, 5, 1, 2, 1, 2, 6, 1, 7, 3, 1, 0, 3, 1, 0, 1, 1, 4, 1, 7, 0, 5, 1, 1, 2, 1, 3, 3, 1, 0, 1, 3, 7, 4, 1, 0, 0, 1, 5, 3, 1, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 COMMENTS For the first one million primes, the distribution of the values (0..8) is {166572, 361136, 69399, 194537, 69405, 69460, 27798, 41693, 0} . - Robert G. Wilson v, Aug 02 2010 LINKS EXAMPLE For n=9 : prime(9)=23, and digital root of 23 = 2+3 = 5, so 23 mod 5 = 3. For n=16 : prime(16)=53, and digital root of 53 = 5+3 = 8, so 53 mod 8 = 5. MATHEMATICA f[n_] := Block[{p = Prime@n}, Mod[p, Mod[p, 9]]]; Array[f, 111] (* Robert G. Wilson v, Aug 02 2010 *) CROSSREFS Cf. A000040, A038194. Sequence in context: A179175 A274635 A146524 * A167274 A201679 A131088 Adjacent sequences:  A179653 A179654 A179655 * A179657 A179658 A179659 KEYWORD nonn,base AUTHOR Jason G. Wurtzel, Jul 23 2010 EXTENSIONS More terms from Robert G. Wilson v, Aug 02 2010 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 December 7 20:21 EST 2019. Contains 329847 sequences. (Running on oeis4.)