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.

A357554 Triangular array read by rows. For T(n,k) where 1 <= k <= n, start with x = k and repeat the map x -> floor(n/x) + (n mod x) until an x occurs that has already appeared, then that is T(n,k).

Table of values

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

List of values

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