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.

A175487 a(n) = smallest prime > a(n-1) such that (a(n-1)+a(n)) is a multiple of nextprime(a(n-1)).

Table of values

n a(n)
1 2
2 7
3 37
4 127
5 397
6 3613
7 18089
8 162881
9 1791787
10 41211197
11 370900973
12 4821712733
13 43395414737
14 477349562419
15 4296146062051
16 227695741289567
17 9335525392876531
18 326743388750679161
19 16663912826284638251
20 583236948919962339073
21 9915028131639359764313

List of values

[2, 7, 37, 127, 397, 3613, 18089, 162881, 1791787, 41211197, 370900973, 4821712733, 43395414737, 477349562419, 4296146062051, 227695741289567, 9335525392876531, 326743388750679161, 16663912826284638251, 583236948919962339073, 9915028131639359764313]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.