OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
FORMULA
EXAMPLE
a(1)=6, which is one larger than the prime 5 and has 2 distinct prime factors (namely 2 and 3).
60 is in the sequence because 59 is prime and 60 = 2^2*3*5 has three distinct prime factors.
MAPLE
A001221 := proc(n) nops(numtheory[factorset](n)) ; end: isA136155 := proc(n) if isprime(n-1) then RETURN( A001221(n)=2 or A001221(n)= 3) ; else RETURN(false) ; fi ; end: for n from 1 to 300 do if isA136155(n) then printf("%d, ", n) ; fi ; od: # R. J. Mathar, May 03 2008
MATHEMATICA
okQ[n_] := PrimeQ[n-1] && (PrimeNu[n]==2 || PrimeNu[n]==3);
Select[Range[6, 300, 2], okQ] (* Jean-François Alcover, Feb 04 2023 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Enoch Haga, Dec 16 2007
EXTENSIONS
Edited by R. J. Mathar and Jens Kruse Andersen, Apr 24 2008
STATUS
approved