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

 

Logo
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

%I #12 Mar 30 2012 17:35:31

%S 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,

%T 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,

%U 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

%N a(n) is the number of terms in the sum in A075405 (or 0 if no such square exists).

%C Note that a(n) is either 0 or a number in A001032.

%D See A180422.

%e a(1) = 25 because the sum 1^2+...+24^2 consists of 25 terms, see A075404.

%t 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<mx && !IntegerQ[Sqrt[s[n, k]]], k++]; If[k==mx, 0, k], {n, 100}]

%Y Cf. A000330, A075404, A075405.

%K nonn

%O 1,1

%A _Zak Seidov_, Sep 13 2002

%E Corrected and extended by _Lior Manor_ Sep 19 2002

%E Corrected and edited by _T. D. Noe_, Jan 21 2011

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)