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.

A063519 Least composite k such that phi(k+12n) = phi(k)+12n and sigma(k+12n) = sigma(k) + 12n where phi is the Euler totient function and sigma is the sum of divisors function.

Table of values

n a(n)
1 65
2 95
3 341
4 95
5 161
6 115
7 629
8 203
9 145
10 203
11 365
12 155
13 185
14 155
15 301
16 185
17 329
18 235
19 1541
20 287
21 185
22 287
23 413
24 205
25 329
26 215
27 469
28 215
29 905
30 371
31 365
32 305
33 553
34 371
35 1037
36 235
37 1145
38 623
39 445
40 371
41 35249
42 295
43 1133
44 371
45 497
46 515
47 749
48 413
49 305
50 671
51 565

List of values

[65, 95, 341, 95, 161, 115, 629, 203, 145, 203, 365, 155, 185, 155, 301, 185, 329, 235, 1541, 287, 185, 287, 413, 205, 329, 215, 469, 215, 905, 371, 365, 305, 553, 371, 1037, 235, 1145, 623, 445, 371, 35249, 295, 1133, 371, 497, 515, 749, 413, 305, 671, 565]