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.

A332511 Numbers k such that phi(k) == 2 (mod 12), where phi is the Euler totient function (A000010).

Table of values

n a(n)
1 3
2 4
3 6
4 121
5 242
6 529
7 1058
8 2209
9 3481
10 4418
11 5041
12 6889
13 6962
14 10082
15 11449
16 13778
17 14641
18 17161
19 22898
20 27889
21 29282
22 32041
23 34322
24 36481
25 51529
26 55778
27 57121
28 63001
29 64082
30 69169
31 72962
32 96721
33 103058
34 114242
35 120409
36 126002
37 128881
38 138338
39 146689
40 175561

List of values

[3, 4, 6, 121, 242, 529, 1058, 2209, 3481, 4418, 5041, 6889, 6962, 10082, 11449, 13778, 14641, 17161, 22898, 27889, 29282, 32041, 34322, 36481, 51529, 55778, 57121, 63001, 64082, 69169, 72962, 96721, 103058, 114242, 120409, 126002, 128881, 138338, 146689, 175561]