login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A225706 Composite squarefree numbers n such that p(i)-6 divides n+6, where p(i) are the prime factors of n. 3

%I #17 May 17 2013 13:43:44

%S 6,10,14,15,21,30,35,42,70,78,105,154,170,210,357,759,1110,6195,42465,

%T 43554,61755,94605,106386,146910,189399,229119,276914,453590,924099,

%U 1239870,2407119,3915714,4404394,4524074,5819145,7396394,8324869,23701854,30242654,33413919

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

%e Prime factors of 8324869 are 7, 19, 53 and 1181. We have that (8324869+6)/(7-6) = 8324875, (8324869+6)/(19-6) = 640375, (8324869+6)/(53-6) = 177125 and (8324869+6)/(1181-6) = 7085.

%p with(numtheory); A225706:=proc(i,j) local c, d, n, ok, p, t;

%p for n from 1 to i do if not isprime(n) then p:=ifactors(n)[2]; ok:=1;

%p for d from 1 to nops(p) do if p[d][2]>1 or p[d][1]=j then ok:=0; break; fi;

%p if not type((n+j)/(p[d][1]-j),integer) then ok:=0; break; fi; od;

%p if ok=1 then print(n); fi; fi; od; end: A225706(10^9,6);

%t t = {}; n = 0; While[Length[t] < 50, n++; {p, e} = Transpose[FactorInteger[n]]; If[Length[p] > 1 && Union[e] == {1} && Union[Mod[n + 6, p - 6]] == {0}, AppendTo[t, n]]]; t (* _T. D. Noe_, May 17 2013 *)

%Y Cf. A208728, A225702-A225705, A225707-A225720.

%K nonn

%O 1,1

%A _Paolo P. Lava_, May 13 2013

%E Extended by _T. D. Noe_, May 17 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 10:21 EDT 2024. Contains 371905 sequences. (Running on oeis4.)