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.

A082449 Let f(p) = greatest prime divisor of p-1. Sequence gives smallest prime which takes at least n steps to reach 2 when f is iterated.

Table of values

n a(n)
0 2
1 3
2 7
3 23
4 47
5 283
6 719
7 1439
8 2879
9 34549
10 138197
11 1266767
12 14619833
13 36449279
14 377982107
15 1432349099
16 22111003847

List of values

[2, 3, 7, 23, 47, 283, 719, 1439, 2879, 34549, 138197, 1266767, 14619833, 36449279, 377982107, 1432349099, 22111003847]