A053719 - cp's OEIS frontend

A053719 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 i values.

n	a(n)
0	55
1	70
2	147
3	226
4	237
5	275
6	351
7	409
8	434
9	610
10	714
11	717
12	869
13	934
14	1085
15	1369
16	1490
17	1602
18	1643
19	1954
20	2363
21	2405
22	2534
23	3020
24	3241
25	3450
26	4017
27	4039
28	4060
29	4140
30	4796
31	5766
32	5830
33	6412
34	8601
35	8635
36	8855
37	8885
38	9423
39	10083
40	10224
41	10809
42	11115
43	11935

[55, 70, 147, 226, 237, 275, 351, 409, 434, 610, 714, 717, 869, 934, 1085, 1369, 1490, 1602, 1643, 1954, 2363, 2405, 2534, 3020, 3241, 3450, 4017, 4039, 4060, 4140, 4796, 5766, 5830, 6412, 8601, 8635, 8855, 8885, 9423, 10083, 10224, 10809, 11115, 11935]

cp's OEIS Frontend

A053719 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 i values.

Table of values

List of values