Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Jun 24 2014 01:08:36
%S 1,8,27,28,80,180,252,208,441,800,891,684,1300,2156,2160,784,816,1728,
%T 912,1920,1008,2112,1104,2304,1200,2496,1296,2688,1392,2880,1488,3072,
%U 1584,3264,1680,3456,1776,3648,1872,3840,1968,4032,2064,4224,2160,4416
%N Beginning with 1 the smallest multiple of n such that the n-th partial sum is a square.
%C Other sequences with every partial sum yielding a square are (1) a(n) = n^3, but n^3 (though a multiple of n) is not the smallest such number for n >3. (2) a(n) = 2n-1.
%F For n>16, a(n) = 48n if n is odd, 96n if n is even.
%e a(4) = 28 as 1+8+27+28 = 64 = 8^2.
%K nonn
%O 1,2
%A _Amarnath Murthy_, Jun 05 2003
%E Edited by _Dean Hickerson_, Jul 20 2003