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”).
%I #7 Aug 30 2018 08:34:04
%S 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,
%T 4398046511104,4,4,4,16,2,4,4,64,2,8,2,8,8,4,2,32768,4,8,4,8,2,64,4,
%U 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
%N Multiplicative with a(p^e) = 2^A000108(e).
%H Antti Karttunen, <a href="/A318476/b318476.txt">Table of n, a(n) for n = 1..511</a>
%H <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>
%F a(n) = 2^A318475(n).
%o (PARI)
%o A000108(n) = (binomial(2*n, n)/(n+1));
%o A318476(n) = factorback(apply(e -> 2^A000108(e),factor(n)[,2]));
%Y Cf. A000108, A318475.
%Y Cf. also A069739.
%K nonn,mult
%O 1,2
%A _Antti Karttunen_, Aug 29 2018