|
Search: id:A083264
|
|
|
| A083264 |
|
n is here if d difference of the largest and the least prime factors of n is also a divisor of n, while d>2 and it is a composite number. |
|
+0
1
|
|
| 198, 396, 510, 594, 792, 966, 990, 1020, 1188, 1386, 1530, 1566, 1584, 1782, 1932, 1980, 2040, 2178, 2376, 2550, 2590, 2772, 2898, 2970, 3060, 3132, 3168, 3198, 3564, 3570, 3864, 3960, 4080, 4158, 4230, 4356, 4590, 4698, 4752, 4830, 4950, 5100, 5180
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
Solutions to Mod[x, d=A006530(x)-A020639(x)]=0, d>2 and d is composite
|
|
EXAMPLE
|
n=198:2.3.3.11=2.9.11, d=11-2=9>2, composite
|
|
MATHEMATICA
|
ffi[x_] := Flatten[FactorInteger[x]]; ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}]; lf[x_] := Length[FactorInteger[x]]; ma[x_] := Max[ba[x]]; mi[x_] := Min[ba[x]] Do[s=ma[ba[n]]-mi[ba[n]]; If[Mod[n, s]==0&&Greater[s, 2]&&!PrimeQ[s], Print[n]], {n, 1, 20000}]
|
|
CROSSREFS
|
Cf. A033845, A071141, A006530, A020639, A083263.
Adjacent sequences: A083261 A083262 A083263 this_sequence A083265 A083266 A083267
Sequence in context: A025366 A055971 A075293 this_sequence A066218 A065697 A075457
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), May 12 2003
|
|
|
Search completed in 0.002 seconds
|
