The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A075406 a(n) is the number of terms in the sum in A075405 (or 0 if no such square exists). 4
 24, 0, 2, 0, 0, 0, 23, 0, 24, 0, 22898, 0, 96, 0, 97, 0, 23, 11, 0, 2, 96, 59, 0, 0, 24, 0, 33, 50, 0, 169, 0, 578, 0, 0, 0, 0, 0, 11, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 122, 0, 96, 0, 0, 3479, 0, 0, 2075, 0, 33, 0, 0, 0, 242, 218, 0, 50, 0, 0, 0, 0, 0, 122, 36481, 0, 24, 0, 0, 0, 0, 0, 0, 194, 0, 0, 0, 50, 0, 0, 0, 242, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Note that a(n) is either 0 or a number in A001032. REFERENCES See A180422. LINKS EXAMPLE a(1) = 25 because the sum 1^2+...+24^2 consists of 25 terms, see A075404. MATHEMATICA s[n_, k_]:=Module[{m=n+k-1}, (m(m+1)(2m+1)-n(n-1)(2n-1))/6]; mx=40000; Table[k=2; While[k

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 27 19:07 EDT 2022. Contains 354897 sequences. (Running on oeis4.)