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.

A217619 a(n) = m/(12*n) where m is the least multiple of n that satisfies phi(m) = phi(m+6*n).

Table of values

n a(n)
1 2
2 2
3 2
4 2
5 3
6 2
7 2
8 2
9 2
10 3
11 2
12 2
13 2
14 2
15 3
16 2
17 2
18 2
19 2
20 3
21 2
22 2
23 2
24 2
25 3
26 2
27 2
28 2
29 2
30 3
31 2
32 2
33 2
34 2
35 5
36 2
37 2
38 2
39 2
40 3
41 2
42 2
43 2
44 2
45 3
46 2
47 2
48 2
49 2
50 3
51 2
52 2
53 2
54 2
55 3
56 2
57 2
58 2
59 2
60 3
61 2
62 2
63 2
64 2
65 3
66 2
67 2
68 2
69 2
70 5
71 2
72 2
73 2
74 2
75 3
76 2
77 2
78 2
79 2
80 3
81 2
82 2
83 2
84 2
85 3
86 2
87 2

List of values

[2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 5, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 5, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2]

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

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