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.

A083396 Least n such that n and 2k+n are both brilliant numbers.

Table of values

n a(n)
1 4
2 6
3 4
4 6
5 4
6 9
7 21
8 9
9 169
10 15
11 121
12 25
13 9
14 21
15 289
16 221
17 15
18 253
19 209
20 9
21 247
22 143
23 253
24 121
25 341
26 169
27 323
28 437
29 319
30 187
31 299
32 649
33 121
34 221
35 253
36 49
37 377
38 247
39 143
40 209
41 391
42 169
43 35
44 121
45 209
46 299
47 49
48 25
49 221
50 21
51 187
52 143
53 15
54 35
55 143
56 9
57 209
58 377
59 25
60 49
61 21

List of values

[4, 6, 4, 6, 4, 9, 21, 9, 169, 15, 121, 25, 9, 21, 289, 221, 15, 253, 209, 9, 247, 143, 253, 121, 341, 169, 323, 437, 319, 187, 299, 649, 121, 221, 253, 49, 377, 247, 143, 209, 391, 169, 35, 121, 209, 299, 49, 25, 221, 21, 187, 143, 15, 35, 143, 9, 209, 377, 25, 49, 21]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.