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.

A071576 a(n) = least k such that 2ik + 1 is prime for all 1 <= i <= n.

Table of values

n a(n)
1 1
2 1
3 1
4 165
5 5415
6 12705
7 256410
8 256410
9 6480303060
10 217245863835
11 946622690475
12 35511547806735
13 439116128090640
14 5714676453270219435

List of values

[1, 1, 1, 165, 5415, 12705, 256410, 256410, 6480303060, 217245863835, 946622690475, 35511547806735, 439116128090640, 5714676453270219435]