A261222 - cp's OEIS frontend

A261222 a(n) = number of steps to reach 0 when starting from k = n*n 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)
0	0
1	1
2	2
3	4
4	6
5	9
6	12
7	15
8	19
9	24
10	29
11	35
12	41
13	48
14	55
15	62
16	70
17	78
18	87
19	97
20	107
21	118
22	129
23	141
24	153
25	165
26	178
27	191
28	205
29	219
30	234
31	249
32	265
33	282
34	299
35	317
36	335
37	354
38	373
39	392
40	412
41	433
42	454
43	475
44	497
45	519
46	542
47	565
48	589
49	613
50	638
51	664
52	690
53	717
54	744
55	772
56	800
57	828
58	857
59	887
60	917
61	948
62	979
63	1010
64	1042
65	1074
66	1107
67	1140
68	1174
69	1208
70	1243
71	1278
72	1314
73	1351
74	1388
75	1426
76	1464
77	1503

[0, 1, 2, 4, 6, 9, 12, 15, 19, 24, 29, 35, 41, 48, 55, 62, 70, 78, 87, 97, 107, 118, 129, 141, 153, 165, 178, 191, 205, 219, 234, 249, 265, 282, 299, 317, 335, 354, 373, 392, 412, 433, 454, 475, 497, 519, 542, 565, 589, 613, 638, 664, 690, 717, 744, 772, 800, 828, 857, 887, 917, 948, 979, 1010, 1042, 1074, 1107, 1140, 1174, 1208, 1243, 1278, 1314, 1351, 1388, 1426, 1464, 1503]

cp's OEIS Frontend

A261222 a(n) = number of steps to reach 0 when starting from k = n*n 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