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.

A354094 a(n) = phi(A354091(n)), where A354091 is fully multiplicative prime shift which replaces the primes of the form 3k+2 by the next larger such prime, while other primes stay as they are, and phi is Euler totient function.

Table of values

n a(n)
1 1
2 4
3 2
4 20
5 10
6 8
7 6
8 100
9 6
10 40
11 16
12 40
13 12
14 24
15 20
16 500
17 22
18 24
19 18
20 200
21 12
22 64
23 28
24 200
25 110
26 48
27 18
28 120
29 40
30 80
31 30
32 2500
33 32
34 88
35 60
36 120
37 36
38 72
39 24
40 1000
41 46
42 48
43 42
44 320
45 60
46 112
47 52
48 1000
49 42
50 440
51 44
52 240
53 58
54 72
55 160
56 600
57 36
58 160
59 70
60 400
61 60
62 120
63 36
64 12500
65 120
66 128
67 66
68 440
69 56
70 240
71 82
72 600
73 72

List of values

[1, 4, 2, 20, 10, 8, 6, 100, 6, 40, 16, 40, 12, 24, 20, 500, 22, 24, 18, 200, 12, 64, 28, 200, 110, 48, 18, 120, 40, 80, 30, 2500, 32, 88, 60, 120, 36, 72, 24, 1000, 46, 48, 42, 320, 60, 112, 52, 1000, 42, 440, 44, 240, 58, 72, 160, 600, 36, 160, 70, 400, 60, 120, 36, 12500, 120, 128, 66, 440, 56, 240, 82, 600, 72]