The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A076461 Sum of squares of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly two ways. 2

%I #15 Sep 08 2022 08:45:07

%S 13,571,5306,26470,93455,264313,640276,1383276,2736465,5047735,

%T 8796238,14621906,23357971,36066485,54076840,79027288,112909461,

%U 158115891,217490530,294382270,392701463,516979441,672431036,865020100,1101528025,1389625263,1737945846,2156164906

%N Sum of squares of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly two ways.

%D Fred. Schuh, Vragen betreffende een onbepaalde vergelijking, Nieuw Tijdschrift voor Wiskunde, 52 (1964-1965) 193-198.

%H Vincenzo Librandi, <a href="/A076461/b076461.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = n*(n+1)*(25*n^4+26*n^3-6*n^2-7*n+1)/6.

%F G.f.: x*(13+480*x+1582*x^2+864*x^3+61*x^4)/(1-x)^7.

%p seq(1/6*n*(n+1)*(25*n^4+26*n^3-6*n^2-7*n+1),n=1..30);

%t CoefficientList[Series[(13 + 480 x + 1582 x^2 + 864 x^3 + 61 x^4)/(1 - x)^7, {x, 0, 50}], x] (* _Vincenzo Librandi_, Dec 30 2013 *)

%o (Magma) [n*(n+1)*(25*n^4+26*n^3-6*n^2-7*n+1)/6: n in [1..50]]; // _Vincenzo Librandi_, Dec 30 2013

%Y Cf. A076389, A076460-A076465.

%K easy,nonn

%O 1,1

%A _Floor van Lamoen_, Oct 13 2002

%E More terms from _Vincenzo Librandi_, Dec 30 2013

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 May 21 02:29 EDT 2024. Contains 372720 sequences. (Running on oeis4.)