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.

A074879 10 - Mod(prime(n),10) when prime(n) + 22 = prime(n+1).

Original entry on oeis.org

1, 9, 9, 3, 1, 1, 1, 3, 3, 1, 3, 1, 3, 1, 1, 3, 1, 9, 1, 3, 1, 3, 1, 9, 1, 3, 9, 3, 9, 3, 3, 1, 9, 3, 1, 1, 3, 9, 9, 3, 3, 1, 1, 3, 9, 9, 1, 1, 3, 3, 1, 3, 3, 1, 1, 1, 9, 9, 1, 1, 9, 3, 1, 9, 1, 3, 1, 1, 9, 1, 1, 1, 3, 1, 3, 9, 9, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 9, 9, 1, 3, 9, 1, 3, 1, 9, 3, 1, 9, 9, 9, 1, 1, 1
Offset: 1

Views

Author

Roger L. Bagula, Sep 30 2002

Keywords

Crossrefs

Programs

  • Magma
    [10-(n mod 10): n in PrimesUpTo(50000) | n+22 eq NextPrime(n)];  // Bruno Berselli, Apr 12 2011
  • Mathematica
    10 - Mod[ Prime[ Select[ Range[5220], Prime[ # ] + 22 == Prime[ # + 1] & ]], 10]
    10-Mod[#,10]&/@Transpose[Select[Partition[Prime[Range[6000]],2,1], Last[#]- First[#]==22&]][[1]] (* Harvey P. Dale, Apr 12 2011 *)

Extensions

Edited by Robert G. Wilson v and N. J. A. Sloane, Oct 03 2002