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.

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

Table of values

n a(n)
1 5
2 8
3 10
4 12
5 17
6 29
7 32
8 34
9 40
10 41
11 48
12 53
13 55
14 58
15 60
16 75
17 82
18 85
19 88
20 89
21 100
22 101
23 106
24 110
25 113
26 115
27 125
28 128
29 132
30 136
31 137
32 145
33 149
34 150
35 160
36 170
37 173
38 178
39 184
40 187
41 192
42 197
43 202
44 204
45 205
46 226
47 230
48 232
49 233
50 235
51 240
52 250
53 253
54 257
55 265
56 269
57 274

List of values

[5, 8, 10, 12, 17, 29, 32, 34, 40, 41, 48, 53, 55, 58, 60, 75, 82, 85, 88, 89, 100, 101, 106, 110, 113, 115, 125, 128, 132, 136, 137, 145, 149, 150, 160, 170, 173, 178, 184, 187, 192, 197, 202, 204, 205, 226, 230, 232, 233, 235, 240, 250, 253, 257, 265, 269, 274]

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

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