cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A318476 Multiplicative with a(p^e) = 2^A000108(e).

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