cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A179656 prime(n) mod (digital root(prime(n))).

Original entry on oeis.org

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
Offset: 1

Views

Author

Jason G. Wurtzel, Jul 23 2010

Keywords

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

Examples

			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.
		

Crossrefs

Programs

  • Mathematica
    f[n_] := Block[{p = Prime@n}, Mod[p, Mod[p, 9]]]; Array[f, 111] (* Robert G. Wilson v, Aug 02 2010 *)

Extensions

More terms from Robert G. Wilson v, Aug 02 2010