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.

A015922 Numbers k such that 2^k == 8 (mod k).

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 8
6 9
7 15
8 21
9 33
10 39
11 51
12 57
13 63
14 69
15 87
16 93
17 111
18 123
19 129
20 141
21 159
22 177
23 183
24 195
25 201
26 213
27 219
28 237
29 248
30 249
31 267
32 291
33 303
34 309
35 315
36 321
37 327
38 339
39 381
40 393
41 399
42 411
43 417
44 447
45 453
46 471
47 489
48 501
49 519
50 537
51 543
52 573
53 579
54 591
55 597
56 633

List of values

[1, 2, 3, 4, 8, 9, 15, 21, 33, 39, 51, 57, 63, 69, 87, 93, 111, 123, 129, 141, 159, 177, 183, 195, 201, 213, 219, 237, 248, 249, 267, 291, 303, 309, 315, 321, 327, 339, 381, 393, 399, 411, 417, 447, 453, 471, 489, 501, 519, 537, 543, 573, 579, 591, 597, 633]