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.

A252230 Triangular array T read by rows: for j = k+1..2*k, k >=1, T(j,k) = least number of iterations of (h,i) -> (i,h-i) needed to take (k,j) to (k',j') satisfying k' <= j'.

Table of values

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

List of values

[1, 2, 1, 2, 3, 1, 2, 2, 3, 1, 2, 2, 4, 3, 1, 2, 2, 2, 3, 3, 1, 2, 2, 2, 4, 3, 3, 1, 2, 2, 2, 2, 5, 3, 3, 1, 2, 2, 2, 2, 4, 3, 3, 3, 1, 2, 2, 2, 2, 2, 4, 3, 3, 3, 1, 2, 2, 2, 2, 2, 4, 5, 3, 3, 3, 1, 2, 2, 2, 2, 2, 2, 4, 3, 3, 3, 3, 1, 2, 2, 2, 2, 2, 2, 4, 6]