|
| |
|
|
A061509
|
|
Write n in decimal, omit 0's, replace each digit k by k-th prime, raise to k-th power and multiply.
|
|
6
| |
|
|
2, 4, 8, 16, 32, 64, 128, 256, 512, 2, 6, 18, 54, 162, 486, 1458, 4374, 13122, 39366, 4, 12, 36, 108, 324, 972, 2916, 8748, 26244, 78732, 8, 24, 72, 216, 648, 1944, 5832, 17496, 52488, 157464, 16, 48, 144, 432, 1296, 3888, 11664, 34992, 104976, 314928
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| a(n) = a(n*10^k). a((10^k-1)/9) = Primorial (k).
Not the same as A189398: a(n) = A189398(n) for n <= 100; a(101)=2^1*3^1 = 6 <> A189398(101) = 2^1*3^0*5^1 = 10; a(A052382(n)) = A189398(A052382(n)) = A000079(A000030(a052382(n))); A001221(a(n)) = A055640(n); A001222(a(n)) = A007953(n). [Reinhard Zumkeller, May 03 2011]
|
|
|
LINKS
| Matthew M. Conroy, Home page (listed instead of email address)
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
EXAMPLE
| a(4) = 2^4 = 16, a(123) = (2^1)*(3^2)*(5^3) = 2250.
|
|
|
PROG
| (Haskell)
a061509 n = product $ zipWith (^)
a000040_list (map digitToInt $ filter (/= '0') $ show n)
-- Reinhard Zumkeller, May 03 2011
|
|
|
CROSSREFS
| Cf. A061510, A000040.
Sequence in context: A113019 A069877 A085940 * A189398 A086066 A085941
Adjacent sequences: A061506 A061507 A061508 * A061510 A061511 A061512
|
|
|
KEYWORD
| base,less,nonn
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 06 2001
|
|
|
EXTENSIONS
| Corrected and extended by Matthew M. Conroy, May 13 2001
Offset corrected by Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 03 2011
|
| |
|
|
