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!)
A134449 Sum of even products minus sum of odd products of different pairs of numbers from 1 to n. 1
0, 2, 5, 29, 39, 129, 150, 374, 410, 860, 915, 1707, 1785, 3059, 3164, 5084, 5220, 7974, 8145, 11945, 12155, 17237, 17490, 24114, 24414, 32864, 33215, 43799, 44205, 57255, 57720, 73592, 74120, 93194, 93789, 116469, 117135, 143849, 144590, 175790 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
Empirical g.f.: x^2*(x^5-6*x^4+2*x^3-16*x^2-3*x-2) / ((x-1)^5*(x+1)^4). - Colin Barker, Sep 03 2013
Conjectures from Colin Barker, Mar 20 2015: (Start)
a(n) = (n^4+4*n^3-2*n^2-4*n)/16 for n even.
a(n) = (n^4-1)/16 for n odd.
(End)
EXAMPLE
{1,2,3} -> 1*2-1*3+2*3 = 5.
{1,2,3,4} -> 1*2-1*3+1*4+2*3+2*4+3*4 = 29.
{1,2,3,4,5} -> 1*2-1*3+1*4-1*5+2*3+2*4+2*5+3*4-3*5+4*5 = 39.
MAPLE
P:=proc(n) local a, i, j, k, w; for i from 1 by 1 to n do a:=0; for j from 1 by 1 to i do w:=j; k:=i; while k>w do a:=a+w*k*(-1)^(w*k); k:=k-1; od; od; print(a); od; end: P(100);
MATHEMATICA
epop[n_]:=Module[{f=Times@@@Subsets[n, {2}]}, Total[Select[f, EvenQ]]-Total[ Select[ f, OddQ]]]; Table[epop[Range[n]], {n, 40}] (* Harvey P. Dale, Sep 17 2017 *)
PROG
(PARI) a(n) = {s = 0; for (i=1, n, for (j=i+1, n, p = i*j; if (p % 2, s -= p, s += p); ); ); s; } \\ Michel Marcus, Mar 20 2015
CROSSREFS
Sequence in context: A165161 A098858 A213995 * A103579 A161500 A061351
KEYWORD
easy,nonn
AUTHOR
STATUS
approved

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 March 18 22:56 EDT 2024. Contains 370952 sequences. (Running on oeis4.)