A225709 -id:A225709 - cp's OEIS frontend

A225710 Composite squarefree numbers n such that p(i)-10 divides n+10, where p(i) are the prime factors of n.

14, 22, 35, 55, 65, 77, 102, 110, 143, 165, 182, 221, 455, 494, 665, 935, 1001, 1173, 1430, 2717, 2795, 4505, 4526, 4862, 5957, 6479, 11526, 27521, 30485, 34661, 35126, 45917, 49715, 52910, 53846, 81686, 90574, 106865, 113477, 118745, 139073, 140822, 147095

Offset: 1

Paolo P. Lava, May 13 2013

nonn

			Prime factors of 34661 are 11, 23 and 137. We have that (34661+10)/(11-10) = 34671, (34661+10)/(23-10) = 2667 and (34661+10)/(137-10) = 273.

Cf. A208728, A225702-A225709, A225711-A225720.

with(numtheory); A225710:=proc(i,j) local c, d, n, ok, p, t;
for n from 1 to i do if not isprime(n) then p:=ifactors(n)[2]; ok:=1;
for d from 1 to nops(p) do if p[d][2]>1 or p[d][1]=j then ok:=0; break; fi;
if  not type((n+j)/(p[d][1]-j),integer) then ok:=0; break; fi; od;
if ok=1 then print(n); fi; fi; od; end: A225710(10^9,10);

t = {}; n = 0; len = -2; While[len <= 262, n++; {p, e} = Transpose[FactorInteger[n]]; If[Length[p] > 1 && Union[e] == {1} && Union[Mod[n + 10, p - 10]] == {0}, AppendTo[t, n]; len = len + Length[IntegerDigits[n]] + 2]]; t (* T. D. Noe, May 17 2013 *)

Extended by T. D. Noe, May 17 2013

A225708 Composite squarefree numbers n such that p(i)-8 divides n+8, where p(i) are the prime factors of n.

Original entry on oeis.org

10, 22, 55, 70, 154, 190, 322, 385, 442, 595, 682, 2002, 2737, 3619, 5530, 14986, 23782, 24817, 25102, 26767, 30430, 31042, 34762, 37810, 85462, 106582, 141427, 171790, 189727, 225910, 243217, 248482, 255142, 272782, 307090, 381547, 388102, 471262, 637849, 798490

Offset: 1

Paolo P. Lava, May 13 2013

nonn

			Prime factors of 381547 are 23, 53 and 313. We have that (381547+8)/(23-8)=25437, (381547+8)/(53-8)=8479 and (381547+8)/(313-8)=1251.

Cf. A208728, A225702-A225707, A225709-A225720.

with(numtheory); A225708:=proc(i,j) local c, d, n, ok, p, t;
for n from 1 to i do if not isprime(n) then p:=ifactors(n)[2]; ok:=1;
for d from 1 to nops(p) do if p[d][2]>1 or p[d][1]=j then ok:=0; break; fi;
if  not type((n+j)/(p[d][1]-j),integer) then ok:=0; break; fi; od;
if ok=1 then print(n); fi; fi; od; end: A225708(10^9,8);

t = {}; n = 0; While[Length[t] < 40, n++; {p, e} = Transpose[FactorInteger[n]]; If[Length[p] > 1 && Union[e] == {1} && Union[Mod[n + 8, p - 8]] == {0}, AppendTo[t, n]]]; t (* T. D. Noe, May 17 2013 *)

cp's OEIS Frontend

A225710 Composite squarefree numbers n such that p(i)-10 divides n+10, where p(i) are the prime factors of n.

Views

Author

Keywords

Examples

Crossrefs

Programs

Maple

Mathematica

Extensions