A358052 - cp's OEIS frontend

A358052 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. The number of applications of the map is T(n,k).

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

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

cp's OEIS Frontend

A358052 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. The number of applications of the map is T(n,k).

Table of values

List of values

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

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

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