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.

A379495 a(n) = A019565(A001065(n)), where A019565 is the base-2 exp-function, and A001065 is the sum of proper divisors of n.

This page as a plain text file.
%I A379495 #8 Jan 05 2025 22:39:03
%S A379495 1,2,2,6,2,15,2,30,5,7,2,11,2,21,14,210,2,110,2,165,42,105,2,65,15,11,
%T A379495 70,385,2,273,2,2310,210,55,70,4290,2,165,22,429,2,2145,2,91,26,231,2,
%U A379495 595,7,546,110,1365,2,51,22,17,330,13,2,7735,2,39,182,30030,66,1785,2,3003,462,357,2,102102,2,91,286,17,66
%N A379495 a(n) = A019565(A001065(n)), where A019565 is the base-2 exp-function, and A001065 is the sum of proper divisors of n.
%H A379495 Antti Karttunen, <a href="/A379495/b379495.txt">Table of n, a(n) for n = 1..32768</a>
%H A379495 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>.
%H A379495 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>.
%o A379495 (PARI)
%o A379495 A019565(n) = { my(m=1, p=1); while(n>0, p = nextprime(1+p); if(n%2, m *= p); n >>= 1); (m); };
%o A379495 A379495(n) = A019565(sigma(n)-n);
%Y A379495 Cf. A001065, A019565, A379496, A379501.
%Y A379495 Cf. also A379493.
%K A379495 nonn
%O A379495 1,2
%A A379495 _Antti Karttunen_, Jan 05 2025