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.

A080373 a(n) is the smallest number k such that GCD of n values of prime(j)-1 for successive j values starting with k is greater than 2, where prime(j) = j-th prime.

Table of values

n a(n)
1 3
2 6
3 24
4 77
5 271
6 271
7 1395
8 1395
9 1395
10 13717
11 34369
12 172146
13 172146
14 804584
15 804584
16 804584
17 12762142
18 16138563
19 16138563
20 56307979
21 56307979
22 56307979
23 56307979
24 56307979
25 1857276773
26 3511121443

List of values

[3, 6, 24, 77, 271, 271, 1395, 1395, 1395, 13717, 34369, 172146, 172146, 804584, 804584, 804584, 12762142, 16138563, 16138563, 56307979, 56307979, 56307979, 56307979, 56307979, 1857276773, 3511121443]