The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227974 Minimum composite squarefree numbers k such that p(i)+n divides k-n, for n=1, 2, 3, 4,..., where p(i) are the prime factors of k . 2
 385, 182, 195, 1054, 165, 6, 1015, 4958, 2193, 10, 5159, 113937, 5593, 14, 15, 196009, 3657, 6318638, 2755, 1227818, 21, 22, 2795, 152358, 12121, 26, 21827, 17578, 36569, 30, 38335, 457907, 33, 34, 35 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Fixed points are the squarefree semiprimes. LINKS EXAMPLE For n=3 the minimum k is 195. Prime factors of 195 are 3, 5 and 13. We have: 195 - 3 = 192, 3 + 3 = 6 and 192 / 6 = 32, 5 + 3 = 8 and 192 / 8 = 24, 13 + 3 = 16 and 192 / 16 = 12. MAPLE with(numtheory); P:=proc(i) local c, d, k, n, ok, p; for k from 1 to i do for n from 2 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 then ok:=0; break; fi; if  not type((n-k)/(p[d][1]+k), integer) then ok:=0; break; fi; od; if ok=1 then print(n); break; fi; fi; od; od; end: P(10^6); CROSSREFS Cf. A208728, A225702-A225720, A227973, A227976. Sequence in context: A071763 A254352 A274445 * A069043 A013591 A152941 Adjacent sequences:  A227971 A227972 A227973 * A227975 A227976 A227977 KEYWORD nonn AUTHOR Paolo P. Lava, Aug 02 2013 STATUS approved

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

Last modified June 1 09:53 EDT 2020. Contains 334762 sequences. (Running on oeis4.)