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”).
%I #6 Aug 08 2015 22:25:53
%S 1,6,105,1728,85085,725760,215656441,522547200,27433728000,
%T 1609445376000,2928046583754721,2824576634880000,50774191064678342417,
%U 6327051662131200000,507067997493657600000,42593711789467238400000
%N a(1) = 1; a(n) = product of n successive primes beginning with n if n is prime else product of n successive composite numbers beginning with n.
%C Contains A075068 as a subsequence. - _R. J. Mathar_, Mar 05 2008
%p nextNonprime := proc(n) local a; for a from n+1 do if not isprime(a) then RETURN(a) ; fi ; od: end: A110342 := proc(n) local res,cnt,nfac; res := n ; if isprime(n) then nfac := nextprime(n) ; for cnt from 2 to n do res := res*nfac ; nfac := nextprime(nfac) ; od: else nfac := nextNonprime(n) ; for cnt from 2 to n do res := res*nfac ; nfac := nextNonprime(nfac) ; od: fi; RETURN(res) ; end: seq(A110342(n),n=1..30) ; # _R. J. Mathar_, Mar 05 2008
%K nonn
%O 1,2
%A _Amarnath Murthy_, Jul 20 2005
%E More terms from _R. J. Mathar_, Mar 05 2008