cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A269563 Integer solutions to the equations Sum_{i} (((-1)^i)*binomial(m, i)*binomial(x - m, t - i)) = 0.

Original entry on oeis.org

9, 16, 17, 22, 25, 33, 34, 36, 41, 49, 57, 64, 65, 66, 67, 73, 81, 86, 89, 97, 98, 100, 105, 113, 121, 129, 132, 134, 137, 144, 145, 153, 161, 162, 169, 177, 185, 193, 196, 201, 209, 214, 217, 225, 226, 233, 241, 249, 256, 257, 262, 265, 273, 281, 289, 297, 305
Offset: 1

Views

Author

René Gy, Feb 29 2016

Keywords

Comments

An integer solution to the equations S(m,s,t) = Sum_{i} (((-1)^i)*binomial(m, i)*binomial(s - m, t - i)) = 0 is an integer s such that there exist integers m, t and 0 < m,t < s/2 such that S(m,s,t)=0.
S(m,s,t)=0 iff S(t,s,m)=0 iff S(s-m,s,t)=0 iff S(s-t,s,m)=0.
If m or t > s, the equation is trivially true, if m or t = s, it is never true.
There are m,t such that 0 < m,t < s/2 and S(m,s,t)=0 iff there are m',t' such that s/2 < m',t' < s and S(m',s,t')=0.
When s is even S(s/2,s,t)=0 (resp. S(m,s,s/2)=0) whenever t (resp. m) is odd. These kinds of super-trivial solutions are not considered.
Therefore the sequence only contains the s for which there exist integers m, t such that 0 < m,t < s/2 and S(m,s,t)=0.

Crossrefs

Cf. A269499.

Programs

  • Mathematica
    f[n_, m_, t_] := Sum[(-1)^i*Binomial[m, i]*Binomial[n - m, t - i], {i, 0, t}]; lim = 200; list = {};
    Do[ Do[Do[If[f[n, m, t] == 0, AppendTo[list, n]], {t, 0, m}], {m, 0, n/2 - 1}], {n, 0, lim}]; Print[Union[list]]
  • PARI
    isok(s) = {for (m=0, s\2-1, for (t=0, m, if (sum(i=0, t, (-1)^i*binomial(m, i)*binomial(s-m, t-i)) == 0, return (1));););} \\ Michel Marcus, Mar 01 2016

Formula

There are some patterns in the sequence (quite easy to see with elementary algebra):
For t(resp. m)=2*k, s=8*k+1, m(resp. t)=4*k-1 is an infinite family of solutions (k>=1). This arithmetic progression (from 9), belongs to the sequence.
For t(resp. m)=2, s=(k+2)^2, m(resp. t)=((k + 2)*(k + 1))/2 is another infinite family of solutions (k>=1). All the squares (from 9) belongs to the sequence.
For t(resp. m)=3, s=3*k^2 + 8*k + 6, m(resp. t)=((k + 1)*(3*k + 2))/2 is another infinite family of solutions (k>=1).
For t(resp. m)=3, s=3*k^2 + 10*k + 9, m(resp. t)=((k + 1)*(3*k + 4))/2 is another infinite family of solutions (k>=0). These polynomial progressions belong to the sequence.

Extensions

More terms from Michel Marcus, Mar 01 2016

A270615 Sporadic solutions s to the equations Sum_i (-1)^i * binomial(m,i) * binomial(s-m,t-i) = 0 listed in increasing order.

Original entry on oeis.org

67, 289, 345, 1029
Offset: 1

Views

Author

René Gy, Mar 20 2016

Keywords

Comments

"Sporadic" solutions s: these are the solutions that remain from A269563, when we remove the four known infinite families of solutions in polynomial progression (see the comments in A269563) and also remove all the nine known infinite families of solutions in exponential progression (see the comments in A269499). These nine families are the s = 2*m + p, where p=4,5,6 or 8 and (m,t) are positive integer solutions to some Diophantine bivariate polynomial equation of degree 2:
p=4 m^2 - 4*m*t + 2*t^2 + 3*m - 8*t + 2 = 0
p=5 5*m^2 - 10*m*t + 4*t^2 + 25*m - 26*t + 32 = 0
p=5 m^2 - 6*m*t + 4*t^2 + 3*m - 14*t + 2 = 0
p=6 m^2 - 8*m*t + 4*t^2 + 3*m - 24*t + 2 = 0
p=8 m^2 - 4*m*t + 2*t^2 + 7*m - 16*t + 16 = 0
1521, 10882, 15043 and 48324 are also "sporadic" solutions, but the list has been checked to be complete up to 1029 only.

Examples

			67 is in the sequence because Sum_i (-1)^i * binomial(m,i) * binomial(67-m,t-i) = 0, when m=22 and t=5. And m=22 and t=5 do not belong to any of the above progressions.
		

Crossrefs

Showing 1-2 of 2 results.