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

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.

Terms

    a(0) =312a(1) =315a(2) =323a(3) =504a(4) =588a(5) =720a(6) =2079a(7) =2170a(8) =2940a(9) =4472a(10) =4914a(11) =5187a(12) =5880a(13) =5984a(14) =6630a(15) =7497a(16) =8721a(17) =8778a(18) =9360a(19) =10296a(20) =10695a(21) =11024a(22) =13104a(23) =14160a(24) =16296a(25) =16380a(26) =18333a(27) =18810a(28) =22022a(29) =22330

External references