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.

A049816 Triangular array T read by rows: T(n,k) = number of nonzero remainders when Euclidean algorithm acts on n and k, for k=1..n, n>=1.

Table of values

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

List of values

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