A260733 - cp's OEIS frontend

A260733 a(n) = number of steps needed to reach zero when starting from k = (n^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	0
2	1
3	3
4	5
5	9
6	13
7	18
8	23
9	30
10	37
11	44
12	52
13	62
14	71
15	81
16	91
17	104
18	117
19	131
20	144
21	159
22	174
23	190
24	207
25	224
26	243
27	262
28	281
29	301
30	321
31	343
32	365
33	388
34	412
35	437
36	461
37	487
38	514
39	539
40	567
41	596
42	625
43	654
44	684
45	715
46	748
47	781
48	814
49	848
50	883
51	918
52	955
53	991
54	1030
55	1067
56	1105
57	1145
58	1187
59	1227
60	1269
61	1311
62	1354
63	1396
64	1441
65	1486
66	1531
67	1579
68	1624
69	1673
70	1723
71	1773
72	1821

[0, 1, 3, 5, 9, 13, 18, 23, 30, 37, 44, 52, 62, 71, 81, 91, 104, 117, 131, 144, 159, 174, 190, 207, 224, 243, 262, 281, 301, 321, 343, 365, 388, 412, 437, 461, 487, 514, 539, 567, 596, 625, 654, 684, 715, 748, 781, 814, 848, 883, 918, 955, 991, 1030, 1067, 1105, 1145, 1187, 1227, 1269, 1311, 1354, 1396, 1441, 1486, 1531, 1579, 1624, 1673, 1723, 1773, 1821]

cp's OEIS Frontend

A260733 a(n) = number of steps needed to reach zero when starting from k = (n^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