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.

A227826 a(0)=3; for n>0, a(n) is the smallest odd prime p such that the n-th prime p_n divides a(n-1)+p.

Original entry on oeis.org

3, 3, 3, 7, 7, 37, 41, 61, 53, 131, 43, 19, 277, 379, 137, 239, 79, 157, 331, 71, 71, 367, 107, 59, 653, 317, 491, 127, 2441, 829, 1657, 883, 1213, 157, 677, 1409, 101, 1783, 173, 829, 3323, 257, 467, 1061, 97, 691, 503, 1607, 1069, 293, 1997
Offset: 0

Views

Author

Daniel Drucker, Jul 21 2013

Keywords

Comments

a(0) could be any odd prime - the rest of the sequence is unchanged.

Crossrefs