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.

A179650 a(n) = (n-th prime) mod (n-th nonprime).

Original entry on oeis.org

0, 3, 5, 7, 2, 3, 5, 5, 8, 13, 13, 17, 20, 21, 23, 3, 7, 7, 11, 11, 9, 13, 15, 19, 25, 25, 25, 27, 25, 25, 37, 39, 41, 41, 49, 49, 1, 1, 2, 5, 8, 7, 11, 7, 8, 7, 16, 25, 23, 22, 23, 23, 19, 26, 29, 32, 35, 31, 34, 35, 31, 38, 49, 50, 49, 47, 58, 61, 68, 67, 68, 71, 73, 76, 79, 77, 77
Offset: 1

Views

Author

Jason G. Wurtzel, Jul 22 2010

Keywords

Comments

In the first 100000 terms, the integers {4, 36, 40, 54} are missing. - Robert G. Wilson v, Jul 23 2010

Examples

			For n=4, 7 mod 8 = 7.
		

Crossrefs

Programs

  • Maple
    A179650 := proc(n) ithprime(n) mod A018252(n) ; end proc: seq(A179650(n),n=1..100) ; # R. J. Mathar, Jul 23 2010
  • Mathematica
    NonPrime[n_Integer] := FixedPoint[n + PrimePi@# &, n + PrimePi@n]; f[n_] := Mod[Prime@n, NonPrime@n]; Array[f, 70] (* Robert G. Wilson v, Jul 23 2010 *)

Extensions

More terms from R. J. Mathar, Robert G. Wilson v and Carl R. White, Jul 23 2010