login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A318885
If n = p^a * q^b * ... * r^c, with p < q < r primes, with nonzero exponents a, b, c, then a(n) = prime(1+p-p)^a * prime(1+q-p)^b * ... * prime(1+r-p)^c; a(1) = 1.
3
1, 2, 2, 4, 2, 6, 2, 8, 4, 14, 2, 12, 2, 26, 10, 16, 2, 18, 2, 28, 22, 58, 2, 24, 4, 74, 8, 52, 2, 42, 2, 32, 46, 106, 10, 36, 2, 122, 62, 56, 2, 78, 2, 116, 20, 158, 2, 48, 4, 98, 94, 148, 2, 54, 34, 104, 118, 214, 2, 84, 2, 226, 44, 64, 46, 174, 2, 212, 146, 182, 2, 72, 2, 302, 50, 244, 22, 222, 2, 112, 16, 346, 2, 156, 82, 362, 206, 232, 2
OFFSET
1,2
LINKS
EXAMPLE
For n = 10 = 2^1 * 5^1, a(n) = prime(1)^1 * prime(1+5-2)^1 = prime(1) * prime(4) = 2*7 = 14.
For n = 55 = 5^1 * 11^1, a(n) = prime(1)^1 * prime(1+11-5)^1 = prime(1) * prime(7) = 2*17 = 34.
For n = 90 = 2^1 * 3^2 * 5^1, a(n) = prime(1)^1 * prime(1+3-2)^2 * prime(1+5-2)^1 = 2^1 * 3^2 * 7^1 = 126.
PROG
(PARI) A318885(n) = if(1==n, n, my(f=factor(n), m=2^f[1, 2], i=1); for(k=2, #f~, i += (f[k, 1]-f[k-1, 1]); m *= prime(i)^f[k, 2]); (m));
CROSSREFS
Cf. A318887 (rgs-transform), A318888.
Sequence in context: A348717 A316437 A137502 * A307088 A143112 A286472
KEYWORD
nonn
AUTHOR
Antti Karttunen, Sep 24 2018
STATUS
approved