A238099 - cp's OEIS frontend

A238099 The stonemason's problem: numbers n such that n^2 is the sum of more than three consecutive cubes, the cube 1 being disallowed.

n	a(n)
1	312
2	315
3	323
4	504
5	588
6	720
7	2079
8	2170
9	2940
10	4472
11	4914
12	5187
13	5880
14	5984
15	6630
16	7497
17	8721
18	8778
19	9360
20	10296
21	10695
22	11024
23	13104
24	14160
25	16296
26	16380
27	18333
28	18810
29	22022
30	22330
31	23247
32	31248
33	36729
34	42021
35	43065
36	43309
37	49665

[312, 315, 323, 504, 588, 720, 2079, 2170, 2940, 4472, 4914, 5187, 5880, 5984, 6630, 7497, 8721, 8778, 9360, 10296, 10695, 11024, 13104, 14160, 16296, 16380, 18333, 18810, 22022, 22330, 23247, 31248, 36729, 42021, 43065, 43309, 49665]

cp's OEIS Frontend

A238099 The stonemason's problem: numbers n such that n^2 is the sum of more than three consecutive cubes, the cube 1 being disallowed.

Table of values

List of values