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.

A049834 Triangular array T given by rows: T(n,k)=sum of quotients when Euclidean algorithm acts on n and k; for k=1,2,...,n; n=1,2,3,...; also number of subtraction steps when computing gcd(n,k) using subtractions rather than divisions.

Table of values

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

List of values

[1, 2, 1, 3, 3, 1, 4, 2, 4, 1, 5, 4, 4, 5, 1, 6, 3, 2, 3, 6, 1, 7, 5, 5, 5, 5, 7, 1, 8, 4, 5, 2, 5, 4, 8, 1, 9, 6, 3, 6, 6, 3, 6, 9, 1, 10, 5, 6, 4, 2, 4, 6, 5, 10, 1, 11, 7, 6, 6, 7, 7, 6, 6, 7, 11, 1, 12, 6, 4, 3, 6, 2, 6, 3, 4, 6, 12, 1, 13, 8, 7, 7, 6, 8, 8, 6, 7, 7, 8, 13, 1]