A260734 - cp's OEIS frontend

A260734 a(n) = number of steps needed to reach (n^2)-1 when starting from k = ((n+1)^2)-1 and repeatedly applying the map that replaces k with k - A002828(k), where A002828(k) = the least number of squares that add up to k.

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

[1, 2, 2, 4, 4, 5, 5, 7, 7, 7, 8, 10, 9, 10, 10, 13, 13, 14, 13, 15, 15, 16, 17, 17, 19, 19, 19, 20, 20, 22, 22, 23, 24, 25, 24, 26, 27, 25, 28, 29, 29, 29, 30, 31, 33, 33, 33, 34, 35, 35, 37, 36, 39, 37, 38, 40, 42, 40, 42, 42, 43, 42, 45, 45, 45, 48, 45, 49, 50, 50, 48, 53, 50, 51, 54, 52, 53, 54, 56, 56, 56, 58, 59, 59, 60, 60, 60, 61, 62, 62, 62, 65, 66, 66, 65]

cp's OEIS Frontend

A260734 a(n) = number of steps needed to reach (n^2)-1 when starting from k = ((n+1)^2)-1 and repeatedly applying the map that replaces k with k - A002828(k), where A002828(k) = the least number of squares that add up to k.

Table of values

List of values

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

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

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