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”).

A318476
Multiplicative with a(p^e) = 2^A000108(e).
2
1, 2, 2, 4, 2, 4, 2, 32, 4, 4, 2, 8, 2, 4, 4, 16384, 2, 8, 2, 8, 4, 4, 2, 64, 4, 4, 32, 8, 2, 8, 2, 4398046511104, 4, 4, 4, 16, 2, 4, 4, 64, 2, 8, 2, 8, 8, 4, 2, 32768, 4, 8, 4, 8, 2, 64, 4, 64, 4, 4, 2, 16, 2, 4, 8, 5444517870735015415413993718908291383296, 4, 8, 2, 8, 4, 8, 2, 128, 2, 4, 8, 8, 4, 8, 2, 32768, 16384, 4, 2, 16, 4, 4, 4, 64, 2, 16, 4, 8, 4, 4, 4
OFFSET
1,2
FORMULA
a(n) = 2^A318475(n).
PROG
(PARI)
A000108(n) = (binomial(2*n, n)/(n+1));
A318476(n) = factorback(apply(e -> 2^A000108(e), factor(n)[, 2]));
CROSSREFS
Cf. also A069739.
Sequence in context: A366196 A278525 A357531 * A226083 A364918 A182730
KEYWORD
nonn,mult
AUTHOR
Antti Karttunen, Aug 29 2018
STATUS
approved