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.

A324321 Numbers k such that Rd(k) == k (mod Ld(k)), where Rd(k) = A067079 and Ld(k) = A067080.

Table of values

n a(n)
1 21
2 23
3 25
4 27
5 29
6 31
7 34
8 37
9 41
10 45
11 49
12 51
13 56
14 61
15 67
16 71
17 78
18 81
19 89
20 91
21 101
22 109
23 114
24 118
25 145
26 175
27 201
28 209
29 251
30 267
31 301
32 365
33 401
34 501
35 529
36 601
37 701
38 801
39 901
40 1001
41 1639
42 2001
43 3001
44 4001
45 5001
46 6001
47 7001
48 8001
49 9001
50 10001
51 20001
52 30001
53 40001

List of values

[21, 23, 25, 27, 29, 31, 34, 37, 41, 45, 49, 51, 56, 61, 67, 71, 78, 81, 89, 91, 101, 109, 114, 118, 145, 175, 201, 209, 251, 267, 301, 365, 401, 501, 529, 601, 701, 801, 901, 1001, 1639, 2001, 3001, 4001, 5001, 6001, 7001, 8001, 9001, 10001, 20001, 30001, 40001]