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.

A084476 Least k such that 10^(2n-1)+k is a brilliant number.

Table of values

n a(n)
1 0
2 3
3 13
4 43
5 81
6 147
7 73
8 3
9 831
10 49
11 987
12 691
13 183
14 4153
15 279
16 667
17 709
18 277
19 1687
20 997
21 1207
22 91
23 1411
24 393
25 951
26 9793
27 2217
28 6229
29 2317
30 213
31 399
32 19
33 2317
34 609
35 2607
36 11901
37 10563
38 5473
39 3
40 5923
41 17527
42 8569
43 16701
44 11989
45 9757
46 6489
47 3489
48 2899

List of values

[0, 3, 13, 43, 81, 147, 73, 3, 831, 49, 987, 691, 183, 4153, 279, 667, 709, 277, 1687, 997, 1207, 91, 1411, 393, 951, 9793, 2217, 6229, 2317, 213, 399, 19, 2317, 609, 2607, 11901, 10563, 5473, 3, 5923, 17527, 8569, 16701, 11989, 9757, 6489, 3489, 2899]

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

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