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-1 of 1 results.

A179993 Numbers m with the property that, when a and b are positive integers such that a*b = m, |a-b| is prime.

Original entry on oeis.org

3, 8, 14, 18, 38, 62, 98, 138, 230, 258, 278, 318, 338, 390, 398, 402, 458, 542, 678, 710, 770, 798, 822, 938, 1022, 1118, 1202, 1238, 1298, 1322, 1490, 1622, 1658, 2030, 2222, 2238, 2378, 2438, 2522, 2558, 2618, 2858, 2910, 3002, 3218, 3230, 3698, 4058, 4178
Offset: 1

Views

Author

Emmanuel Vantieghem, Aug 05 2010, Aug 06 2010

Keywords

Comments

All numbers in this sequence are congruent to 0 or 2 mod 3.
It is not known if this sequence is infinite. For n > 1 all terms are even.
The intersection with A080715 seems to be empty. Is this provable ?
From Amiram Eldar, Nov 15 2021: (Start)
The nonsquarefree terms of this sequence, 8, 18, 98, 338, ..., are numbers of the form 2*p^2, where p is in A349327.
The least terms with 1, 2, 3, 4 and 5 distinct prime divisors are 3, 14, 138, 390 and 13576178, respectively. Are there terms with more than 5 distinct prime divisors? (End)
All terms have either 6 (for a(n) = 2*A349327^2) or 2^k (for a(n) in A005117) divisors. - Samuel Harkness, Mar 02 2023

Examples

			Example : For n = 5, the possible values of |a-b| are 17 = 19-2 and 37 = 38-1.
		

Crossrefs

Programs

  • Mathematica
    m=1;While[m < 10000, m++; If[Mod[m, 3] == 1, , V = Divisors[m]; L = Length[V]; j = 0; While[j < L/2, j++; x = (m/V[[j]]) - V[[j]]; If[PrimeQ[x], , j = L]]; If[j == L/2, X = Append[X, m],]]]; X
    q[n_] := AllTrue[Divisors[n], #^2 > n || PrimeQ[Abs[# - n/#]] &]; Select[Range[4000], q] (* Amiram Eldar, Nov 15 2021 *)
  • Python
    from itertools import islice, takewhile, count
    from sympy import isprime, divisors
    def A179993(): # generator of terms
        for m in count(1):
            if all(isprime(m//a-a) for a in takewhile(lambda x: x*x <= m, divisors(m))):
                yield m
    A179993_list = list(islice(A179993(),20)) # Chai Wah Wu, Nov 15 2021
Showing 1-1 of 1 results.