login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A336323
Numbers composite(n) such that gcd(n,composite(n)) > 1.
2
6, 10, 12, 14, 18, 21, 24, 25, 26, 28, 32, 33, 34, 36, 39, 42, 45, 48, 50, 52, 60, 68, 70, 72, 74, 76, 77, 78, 84, 86, 87, 88, 90, 95, 98, 100, 102, 104, 105, 106, 110, 111, 112, 124, 128, 130, 132, 135, 138, 140, 145, 147, 150, 158, 160, 162, 165, 168, 170
OFFSET
1,1
LINKS
FORMULA
a(n) = A002808(A334880(n)). - Michel Marcus, Jul 19 2020
MAPLE
compn:= 0: R:= NULL: count:= 0:
for n from 4 while count < 100 do
if not isprime(n) then
compn:= compn+1;
if igcd(compn, n) > 1 then
R:= R, n; count:= count+1;
fi
fi
od:
R; # Robert Israel, Aug 09 2020
MATHEMATICA
c = Select[Range[2, 250], ! PrimeQ[#] &]; (* A002808 *)
u = Select[Range[Length[c]], GCD[c[[#]], #] > 1 &] ; (* A334880 *)
Table[c[[u[[n]]]], {n, 1, Length[u]}] (* A336323 *)
PROG
(PARI) lista(nn) = {my(n=0, list=List()); forcomposite (c=1, nn, n++; if (gcd(n, c) > 1, listput(list, c))); Vec(list); } \\ Michel Marcus, Jul 19 2020
CROSSREFS
Sequence in context: A362012 A334166 A363171 * A175352 A175397 A129493
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jul 18 2020
STATUS
approved