A136355
Numbers of the form P = product of the first k odd primes where P+2 is composite.
Original entry on oeis.org
1155, 255255, 4849845, 111546435, 152125131763605, 6541380665835015, 16294579238595022365, 58644190679703485491635, 3929160775540133527939545, 278970415063349480483707695, 20364840299624512075310661735, 1608822383670336453949542277065
Offset: 1
a(1)=1155 because 1157 is not prime.
-
v=Select[Range[21],!PrimeQ[Product[Prime[k+1],{k,#}]+2]&]; Table[Product[Prime[k+1],{k,v[[t]]}],{t,Length[v]}] (* Farideh Firoozbakht, Aug 12 2009 *)
Select[FoldList[Times,Prime[Range[2,22]]],CompositeQ[#+2]&] (* Harvey P. Dale, Jun 08 2022 *)
A136353
First odd composite N divisible by precisely the first n odd primes with N-2 prime.
Original entry on oeis.org
9, 15, 105, 1155, 15015, 255255, 4849845, 111546435, 9704539845, 100280245065, 18551845337025, 152125131763605, 98120709987525225, 7071232499767651215, 16294579238595022365, 33648306127698721183725, 527797716117331369424715
Offset: 1
The first odd prime is 3, 3*3-2 = 7 is prime so a(1) = 9.
The product of the first two odd primes is 15, and 15-2 is prime, so a(2) = 15.
-
a[n_]:=(c=Product[Prime[k],{k,2,n+1}];For[m=1,!(!PrimeQ[c (2m-1)]&&PrimeQ[c(2m-1)-2]&&Length[FactorInteger[c(2m-1)]]==n),m++ ];c(2m-1));Table[a[n],{n,20}] (* Enoch Haga, Jul 02 2009 *)
-
sm(n,x)=forprime(p=2,x, n/=p^valuation(n,p)); n==1
a(n)=my(m=factorback(primes(n+1)[2..n+1]),k,p=prime(n+1)); while(!isprime(k++*m-2) && sm(k,p),); k*m \\ Charles R Greathouse IV, Sep 14 2015
A136357
Increasing sequence obtained by union of two sequences A136354 and {b(n)}, where b(n) is the smallest composite number m such that m+1 is prime and the set of distinct prime factors of m consists of the first n primes.
Original entry on oeis.org
4, 6, 9, 15, 30, 105, 210, 2310, 3465, 15015, 120120, 765765, 4084080, 33948915, 106696590, 334639305, 892371480, 3234846615, 71166625530, 100280245065, 200560490130, 3710369067405, 29682952539240, 1369126185872445
Offset: 1
a(4)=15 because k=2 with prime factors 3 and 5 and 15 is followed by 17, prime;
a(5)=30 because k=3 with prime factors 2, 3, 5 and 30 is followed by 31, prime.
-
a[n_]:=(c=Product[Prime[k],{k,n}]; For[m=1,!(!PrimeQ[c*m]&&PrimeQ[c*m+1]&& Length[FactorInteger[c*m]]==n),m++ ]; c*m);
b[n_]:=(c=Product[Prime[k],{k,2, n+1}]; For[m=1,!(!PrimeQ[c(2*m-1)]&&PrimeQ[c(2*m-1)+2]&&Length[FactorInteger [c(2*m-1)]]==n),m++ ]; c(2*m-1));
Take[Union[Table[a[k],{k,24}],Table[b[k],{k, 24}]],24] (* Farideh Firoozbakht, Aug 13 2009 *)
Showing 1-3 of 3 results.
Comments