|
|
A276092
|
|
a(n) = Product_{i=1..n} prime(i)^(prime(i)-1), a(0)=1.
|
|
3
|
|
|
1, 2, 18, 11250, 1323551250, 34329510752434301250, 799811863723341113907011901401250, 38919798565076223182552300534870824616780123359001250, 4052615498709835178737678586220586796222761283625319842830388618784835051250, 3679152532021669595137666762315244807517735994898621013565758767014111825486079213219685771368099483111250
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Product_{i=1..n} prime(i)^(prime(i)-1).
|
|
EXAMPLE
|
For n=0 we have an empty product, thus a(0) = 1.
For n=1, a(1) = 2^1.
For n=2, a(2) = 2^1 * 3^2 = 18.
For n=3, a(3) = 2^1 * 3^2 * 5^4 = 11250.
|
|
MATHEMATICA
|
Table[Product[Prime[i]^(Prime[i] - 1), {i, n}], {n, 0, 9}] (* Michael De Vlieger, Aug 31 2016 *)
|
|
PROG
|
(Scheme)
(define (A276092 n) (let outloop ((i n) (t 1)) (if (zero? i) t (let ((p (A000040 i))) (let inloop ((j (- p 1)) (t t)) (if (zero? j) (outloop (- i 1) t) (inloop (- j 1) (* t p))))))))
;; Or as a recurrence:
(PARI)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|