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.

A306833 a(1) = 3; a(n+1) is the smallest k > a(n) such that 2^(k-1) == 1 (mod a(n)).

Table of values

n a(n)
1 3
2 5
3 9
4 13
5 25
6 41
7 61
8 121
9 221
10 241
11 265
12 313
13 469
14 529
15 760

List of values

[3, 5, 9, 13, 25, 41, 61, 121, 221, 241, 265, 313, 469, 529, 760]