OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
FORMULA
A275451(a(n)) > 0.
EXAMPLE
Primorial(3) equals 30, which contains 3, therefore 3 is in the sequence.
MAPLE
count:= 0:
P:= 2; p:= 2;
for n from 2 while count < 1000 do
p:= nextprime(p);
P:= P*p;
if StringTools:-Search(sprintf("%d", n), sprintf("%d", P))<>0 then
count:= count+1;
A[count]:= n;
fi
od:
seq(A[i], i=1..count); # Robert Israel, Jul 29 2016
MATHEMATICA
primorial[n_]:=Product[Prime[i], {i, 1, n}];
Select[Range@500, StringContainsQ[ToString[primorial[#]], ToString[#]]&]
PROG
(Perl) use ntheory ":all"; my @a275450 = grep { index(pn_primorial($_), $_) >= 0 } 1 .. 1000; say "@a275450"; # Dana Jacobsen, Aug 09 2016
CROSSREFS
KEYWORD
base,easy,nonn
AUTHOR
Ivan N. Ianakiev, Jul 28 2016
STATUS
approved