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.

A175450 a(n)>a(n-1), a(n) = smallest prime greater than a(n-1) such that a(n)+a(n-1) is multiple of m, a(1)=2, m=19.

Original entry on oeis.org

2, 17, 59, 131, 173, 283, 401, 587, 743, 853, 857, 929, 971, 1423, 1427, 1499, 1579, 1613, 1693, 1879, 1997, 2069, 2111, 2221, 2339, 2411, 2719, 2753, 2833, 3019, 3023, 3209, 3251, 3323, 3517, 3779, 3821, 3931, 4049, 4159, 4201, 4273, 4391, 4463, 4657
Offset: 1

Views

Author

Zak Seidov, May 28 2010

Keywords

Crossrefs

Cf. A175451.

Programs

  • Mathematica
    nxt[n_]:=Module[{k=NextPrime[n]},While[!Divisible[n+k,19],k=NextPrime[ k]]; k]; NestList[nxt,2,50] (* Harvey P. Dale, Mar 12 2014 *)

Extensions

Definition corrected by Harvey P. Dale, Mar 12 2014