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”).

Numbers n such that n^2-1 are products of 3 distinct primes.
3

%I #8 Jul 24 2016 16:51:25

%S 14,16,20,22,32,36,38,40,52,54,58,66,68,70,78,84,88,90,96,110,112,114,

%T 128,130,132,140,156,158,162,178,182,200,210,212,222,234,238,250,252,

%U 258,264,268,292,294,306,308,310,318,330,336,338,354,366,372,378,380

%N Numbers n such that n^2-1 are products of 3 distinct primes.

%C 14^2-1=195=3*5*13, 16^2-1=255=3*5*17, 20^2-1=399=3*7*19.

%C All terms are even since n^2-1 for n odd is a multiple of 4. If m is a term, then (m-1, m+1) contains one prime and one nonsquare semiprime. - _Chai Wah Wu_, Mar 28 2016

%H Chai Wah Wu, <a href="/A176686/b176686.txt">Table of n, a(n) for n = 1..10000</a>

%t Select[Range[6! ],Last/@FactorInteger[ #^2-1]=={1,1,1}&]

%t Sqrt[#+1]&/@Select[Sort[Times@@@Subsets[Prime[Range[100]],{3}]], IntegerQ[ Sqrt[#+1]]&] (* _Harvey P. Dale_, Jul 24 2016 *)

%Y Cf. A006881, A007304, A014574, A046386

%K nonn

%O 1,1

%A _Vladimir Joseph Stephan Orlovsky_, Apr 23 2010