A261223 - cp's OEIS frontend

A261223 a(n) = number of steps to reach 0 when starting from k = (n*n)-1 and repeatedly applying the map that replaces k with k - A053610(k), where A053610(k) = the number of positive squares that sum to k using the greedy algorithm.

n	a(n)
1	0
2	1
3	3
4	5
5	8
6	11
7	14
8	18
9	23
10	28
11	34
12	40
13	47
14	54
15	61
16	69
17	77
18	86
19	96
20	106
21	117
22	128
23	140
24	152
25	164
26	177
27	190
28	204
29	218
30	233
31	248
32	264
33	281
34	298
35	316
36	334
37	353
38	372
39	391
40	411
41	432
42	453
43	474
44	496
45	518
46	541
47	564
48	588
49	612
50	637
51	663
52	689
53	716
54	743
55	771
56	799
57	827
58	856
59	886
60	916
61	947
62	978
63	1009
64	1041
65	1073
66	1106
67	1139
68	1173
69	1207
70	1242
71	1277
72	1313
73	1350
74	1387
75	1425
76	1463
77	1502
78	1541

[0, 1, 3, 5, 8, 11, 14, 18, 23, 28, 34, 40, 47, 54, 61, 69, 77, 86, 96, 106, 117, 128, 140, 152, 164, 177, 190, 204, 218, 233, 248, 264, 281, 298, 316, 334, 353, 372, 391, 411, 432, 453, 474, 496, 518, 541, 564, 588, 612, 637, 663, 689, 716, 743, 771, 799, 827, 856, 886, 916, 947, 978, 1009, 1041, 1073, 1106, 1139, 1173, 1207, 1242, 1277, 1313, 1350, 1387, 1425, 1463, 1502, 1541]

cp's OEIS Frontend

A261223 a(n) = number of steps to reach 0 when starting from k = (n*n)-1 and repeatedly applying the map that replaces k with k - A053610(k), where A053610(k) = the number of positive squares that sum to k using the greedy algorithm.

Table of values

List of values