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!)
A142591 Composite terms in A143578. 3
15, 35, 95, 119, 143, 209, 287, 319, 323, 377, 527, 559, 779, 899, 923, 989, 1007, 1189, 1199, 1343, 1349, 1763, 1919, 2159, 2507, 2759, 2911, 3239, 3599, 3827, 4031, 4607, 5183, 5207, 5249, 5459, 5543, 6439, 6887, 7067, 7279, 7739, 8159, 8639, 9179, 9593 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Conjecture: This consists exactly of the semiprimes pq for which p + q divides pq + 1. - Mohamed Bouhamida, Aug 17 2009] (Comment edited by N. J. A. Sloane, Sep 01 2019.)
LINKS
MAPLE
filter:= proc(n) local k, D, j, t;
D:= select(t -> t^2 <= n, numtheory:-divisors(n));
j:= max(D);
t:= j+n/j;
andmap(k -> (k+n/k) mod t = 0, D);
end proc:
count:= 0: S:= NULL:
for n from 2 while count < 100 do
if isprime(n) then next
elif filter(n) then
count:= count+1;
S:= S, n;
fi
od:
S; # Robert Israel, Sep 01 2019
MATHEMATICA
Select[Reap[Module[{n, k}, For[n = 1, n < 10000, n++, k = Max[Select[Divisors[n], # <= Sqrt[n]&]]; If[Length[Union[ Mod[Divisors[n] + n/Divisors[n], k+n/k]]] == 1, Sow[n]]]]][[2, 1]], CompositeQ] (* Jean-François Alcover, Feb 07 2023 *)
CROSSREFS
Cf. A143578.
Sequence in context: A238232 A061367 A070161 * A321617 A254031 A074480
KEYWORD
nonn
AUTHOR
Leroy Quet, Aug 24 2008
EXTENSIONS
More terms from M. F. Hasler, Aug 25 2008
a(33)-a(46) from Ray Chandler, Jun 21 2009
STATUS
approved

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 March 19 01:34 EDT 2024. Contains 370952 sequences. (Running on oeis4.)