|
Search: id:A127482
|
|
|
| A127482 |
|
Product of the nonzero digital products of all the prime numbers p(1) to p(n). |
|
+0
1
|
|
| 2, 6, 30, 210, 210, 630, 4410, 39690, 238140, 4286520, 12859560, 270050760, 1080203040, 12962436480, 362948221440, 5444223321600, 244990049472000, 1469940296832000, 61737492466944000, 432162447268608000
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n)=product{1<=k<=n, dp_p(prime(k)} where prime(k)=A000040(k) and dp_p(m)=product of the non-zero digits of m in base p (p=10 for this sequence). - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Sep 29 2007
|
|
EXAMPLE
|
a(7)=dp_10(2)*dp_10(3)*dp_10(5)*dp_10(7)*dp_10(11)*dp_10(13)*dp_10(17)=2*3*5*7*(1*1)*(1*3)*(1*7)=4410.
|
|
CROSSREFS
|
Cf. A007953, A007954, A131385, A131387, A131451.
Cf. A000040.
Sequence in context: A112385 A078700 A104561 this_sequence A118747 A129779 A068215
Adjacent sequences: A127479 A127480 A127481 this_sequence A127483 A127484 A127485
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Alain Van Kerckhoven (alain(AT)avk.org), Sep 12 2007
|
|
EXTENSIONS
|
Corrected and extended by Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Sep 29 2007
|
|
|
Search completed in 0.002 seconds
|
