A094519
Numbers having at least one pair (x,y) of divisors with x
6, 12, 18, 20, 24, 30, 36, 40, 42, 48, 54, 56, 60, 66, 70, 72, 78, 80, 84, 90, 96, 100, 102, 108, 110, 112, 114, 120, 126, 132, 138, 140, 144, 150, 156, 160, 162, 168, 174, 180, 182, 186, 192, 198, 200, 204, 210, 216, 220, 222, 224, 228, 234, 240, 246
Offset: 1
Keywords
Links
- Amiram Eldar, Table of n, a(n) for n = 1..10000
Crossrefs
Programs
-
Mathematica
aQ[n_] := AnyTrue[Total /@ Subsets[Divisors[n], {2}], Divisible[n, #] &]; Select[Range[250], aQ] (* Amiram Eldar, Aug 31 2019 *)
-
PARI
is(n) = {my(d = divisors(n)); for(i = 1, #d - 2, for(j = i + 1, #d - 1, if(n % (d[i] + d[j]) == 0, return(1) ) ) ); 0 } \\ David A. Corneth, Aug 31 2019
-
Python
from itertools import count, islice from sympy import divisors def A094519_gen(): # generator of terms for n in count(1): for i in range(1,len(d:=divisors(n))): di = d[i] for j in range(i): if n % (di+d[j]) == 0: yield n break else: continue break A094519_list = list(islice(A094519_gen(),20)) # Chai Wah Wu, Dec 26 2021
Formula
A094518(a(n)) > 0.
Comments