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.

A082743 a(0)=1, a(1)=2; for n >= 2, a(n) is smallest palindrome greater than 1 which is congruent to 1 (mod n).

Table of values

n a(n)
0 1
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 55
10 11
11 111
12 121
13 66
14 99
15 121
16 33
17 171
18 55
19 77
20 101
21 22
22 111
23 323
24 121
25 101
26 131
27 55
28 141
29 88
30 121
31 373
32 33
33 232
34 171
35 141
36 181
37 1111
38 77
39 313
40 121
41 575
42 505
43 44
44 353
45 181
46 323
47 424
48 1441
49 99
50 101
51 868
52 313
53 10601
54 55
55 111
56 393
57 343
58 929
59 414

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 55, 11, 111, 121, 66, 99, 121, 33, 171, 55, 77, 101, 22, 111, 323, 121, 101, 131, 55, 141, 88, 121, 373, 33, 232, 171, 141, 181, 1111, 77, 313, 121, 575, 505, 44, 353, 181, 323, 424, 1441, 99, 101, 868, 313, 10601, 55, 111, 393, 343, 929, 414]