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.

A201819 Numbers n such that 90*n + 31 is prime.

Original entry on oeis.org

0, 2, 6, 7, 8, 11, 13, 14, 15, 16, 19, 20, 22, 25, 26, 28, 30, 33, 35, 36, 37, 39, 40, 47, 49, 51, 53, 60, 61, 63, 64, 65, 68, 71, 74, 75, 76, 77, 81, 82, 84, 85, 88, 91, 92, 95, 97, 99, 104, 107, 110, 112, 118, 120, 128, 130, 131, 138, 139, 141, 146, 149
Offset: 1

Views

Author

J. W. Helkenberg, Dec 05 2011

Keywords

Comments

This sequence was generated by adding 14 Fibonacci-like sequences. Looking at the format 90n+31 modulo 9 and modulo 10 we see that all entries of A142328 have digital root 4 and last digit 1. (Reverting the process is an application of the Chinese remainder theorem.)

Crossrefs

Programs