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.

A025052 Numbers not of form ab + bc + ca for 1<=a<=b<=c (probably the list is complete).

Original entry on oeis.org

1, 2, 4, 6, 10, 18, 22, 30, 42, 58, 70, 78, 102, 130, 190, 210, 330, 462
Offset: 1

Views

Author

Keywords

Comments

According to Borwein and Choi, if the Generalized Riemann Hypothesis is true, then this sequence has no larger terms, otherwise there may be one term greater than 10^11. - T. D. Noe, Apr 08 2004
Note that n+1 must be prime for all n in this sequence. - T. D. Noe, Apr 28 2004
Borwein and Choi prove (Theorem 6.2) that the equation N=xy+xz+yz has an integer solution x,y,z>0 if N contains a square factor and N is not 4 or 18. In the following simple proof explicit solutions are given. Let N=mn^2, m,n integer, m>0, n>1. If n3: x=6, y=n-3, z=n^2-4n+6. If n>m+1: if n=0 (mod m+1): x=m+1, y=m(m+1), z=m(n^2/(m+1)^2-1), if n=k (mod m+1), 0

Crossrefs

Subsequence of A000926 (numbers not of the form ab+ac+bc, 0A006093.
Cf. A093669 (numbers having a unique representation as ab+ac+bc, 0A093670 (numbers having a unique representation as ab+ac+bc, 0<=a<=b<=c).

Programs

  • Mathematica
    n=500; lim=Ceiling[(n-1)/2]; lst={}; Do[m=a*b+a*c+b*c; If[m<=n, lst=Union[lst, {m}]], {a, lim}, {b, lim}, {c, lim}]; Complement[Range[n], lst]

Extensions

Corrected by R. H. Hardin