A359802 a(n) = product prime(d + 1), where d ranges over all the decimal digits of n.

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 6, 9, 15, 21, 33, 39, 51, 57, 69, 87, 10, 15, 25, 35, 55, 65, 85, 95, 115, 145, 14, 21, 35, 49, 77, 91, 119, 133, 161, 203, 22, 33, 55, 77, 121, 143, 187, 209, 253, 319, 26, 39, 65, 91, 143, 169, 221, 247, 299, 377, 34, 51

Offset: 0

Author

Fabian I. Garcia, May 11 2023

Keywords

• nonn
• easy
• base

Examples

			a(0) = prime(0+1) = prime(1) = 2.
a(5) = prime(5+1) = prime(6) = 13.
a(20) = prime(2+1) * prime(0+1) = prime(3) * prime(1) = 5 * 2 = 10.
		

Links

• David A. Corneth, Table of n, a(n) for n = 0..10000

Crossrefs

Very similar to A113581.

Fixed points are in A115078.

Programs

Maple

a:= n-> mul(ithprime(d+1), d=convert(n, base, 10)):
seq(a(n), n=0..171);  # Alois P. Heinz, May 11 2023

PARI

a(n) = my(d=digits(n)); if (n==0, d=[0]); prod(k=1, #d, prime(d[k]+1)); \\ Michel Marcus, May 12 2023

Python

def a(n):
    primes = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29)
    product = 1
    for d in str(n):
        product *= primes[int(d)]
    return product