A053721 - cp's OEIS frontend

A053721 Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives k values.

n	a(n)
0	42
1	24
2	50
3	126
4	124
5	212
6	136
7	189
8	304
9	439
10	461
11	145
12	375
13	399
14	219
15	742
16	417
17	742
18	1239
19	1100
20	1058
21	1474
22	1569
23	434
24	1126
25	2669
26	3076
27	580
28	2650
29	3170
30	3531
31	3921
32	3647
33	4525
34	3484
35	963
36	3317
37	5596
38	5559
39	3503
40	6969
41	1205
42	6083
43	5323
44	6962
45	4088

[42, 24, 50, 126, 124, 212, 136, 189, 304, 439, 461, 145, 375, 399, 219, 742, 417, 742, 1239, 1100, 1058, 1474, 1569, 434, 1126, 2669, 3076, 580, 2650, 3170, 3531, 3921, 3647, 4525, 3484, 963, 3317, 5596, 5559, 3503, 6969, 1205, 6083, 5323, 6962, 4088]

cp's OEIS Frontend

A053721 Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives k values.

Table of values

List of values