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.

A000188 (1) Number of solutions to x^2 == 0 (mod n). (2) Also square root of largest square dividing n. (3) Also max_{ d divides n } gcd(d, n/d).

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1, 4, 1, 3, 1, 2, 1, 1, 1, 2, 5, 1, 3, 2, 1, 1, 1, 4, 1, 1, 1, 6, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 4, 7, 5, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 1, 3, 8, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 5, 2, 1, 1, 1, 4, 9, 1, 1, 2, 1, 1, 1, 2, 1, 3]