A260732 - cp's OEIS frontend

A260732 a(n) = number of steps needed to reach zero when starting from k = n^2 and repeatedly applying the map that replaces k with k - {the least number of squares (A002828) that add up to k}.

n	a(n)
0	0
1	1
2	2
3	4
4	6
5	10
6	14
7	19
8	24
9	31
10	38
11	45
12	53
13	63
14	72
15	82
16	92
17	105
18	118
19	132
20	145
21	160
22	175
23	191
24	208
25	225
26	244
27	263
28	282
29	302
30	322
31	344
32	366
33	389
34	413
35	438
36	462
37	488
38	515
39	540
40	568
41	597
42	626
43	655
44	685
45	716
46	749
47	782
48	815
49	849
50	884
51	919
52	956
53	992
54	1031
55	1068
56	1106
57	1146
58	1188
59	1228
60	1270
61	1312
62	1355
63	1397
64	1442
65	1487
66	1532
67	1580
68	1625

[0, 1, 2, 4, 6, 10, 14, 19, 24, 31, 38, 45, 53, 63, 72, 82, 92, 105, 118, 132, 145, 160, 175, 191, 208, 225, 244, 263, 282, 302, 322, 344, 366, 389, 413, 438, 462, 488, 515, 540, 568, 597, 626, 655, 685, 716, 749, 782, 815, 849, 884, 919, 956, 992, 1031, 1068, 1106, 1146, 1188, 1228, 1270, 1312, 1355, 1397, 1442, 1487, 1532, 1580, 1625]

cp's OEIS Frontend

A260732 a(n) = number of steps needed to reach zero when starting from k = n^2 and repeatedly applying the map that replaces k with k - {the least number of squares (A002828) that add up to k}.

Table of values

List of values