The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A286630 a(0) = 1; for n >= 1, a(n) = A000040(n) * A002110(n). 3
 1, 4, 18, 150, 1470, 25410, 390390, 8678670, 184294110, 5131136010, 187621103670, 6217375194030, 274567310987970, 12474260804615610, 562558737261811290, 28899819781659096270, 1727225399291072370690, 113442860659098545705130, 7154591262923825229979470, 526507543922377892743899030, 39613798938995626228686492690 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS The terms a(0) .. a(5), when viewed in primorial base (A049345) look as: 1, 20, 300, 5000, 70000, E00000, where "E" stands for the digit eleven. LINKS Antti Karttunen, Table of n, a(n) for n = 0..120 FORMULA a(0) = 1; for n >= 1, a(n) = A000040(n) * A002110(n). For n >= 1, a(n) = A001248(n) * A002110(n-1) = A002110(n) + A286629(n). MATHEMATICA Table[If[n==0, 1, Prime[n] Product[Prime[k], {k, n}]], {n, 0, 100}] (* Indranil Ghosh, Jul 07 2017 *) PROG (Scheme) (define (A286630 n) (if (zero? n) 1 (* (A000040 n) (A002110 n)))) (Python) from sympy import prime, primorial def a002110(n): return 1 if n<1 else primorial(n) def a(n): return 1 if n==0 else prime(n)*a002110(n) print([a(n) for n in range(41)]) # Indranil Ghosh, Jul 07 2017 (PARI) a(n) = if (n==0, 1, prime(n)*prod(k=1, n, prime(k))); \\ Michel Marcus, Jul 07 2017 CROSSREFS Cf. A000040, A001248, A002110, A286629. Subsequence of A276155. Sequence in context: A220266 A218917 A054759 * A330467 A222766 A302827 Adjacent sequences:  A286627 A286628 A286629 * A286631 A286632 A286633 KEYWORD nonn AUTHOR Antti Karttunen, Jul 07 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 25 18:38 EDT 2022. Contains 354851 sequences. (Running on oeis4.)