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.

A303837 Number of z-trees with least common multiple n > 1.

Table of values

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

List of values

[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 4, 1, 1, 1, 1, 1, 4, 1, 1, 1, 3, 1, 4, 1, 2, 2, 1, 1, 4, 1, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 10, 1, 1, 2, 1, 1, 4, 1, 2, 1, 4, 1, 6, 1, 1, 2, 2, 1, 4, 1, 4, 1, 1, 1, 10, 1, 1, 1]