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.

A379493 a(n) = A276086(A001065(n)), where A276086 is the primorial base exp-function, and A001065 is the sum of proper divisors of n.

This page as a plain text file.
%I A379493 #6 Jan 05 2025 13:36:48
%S A379493 1,2,2,6,2,5,2,10,9,15,2,225,2,45,30,150,2,750,2,1125,90,75,2,35,5,
%T A379493 225,50,5625,2,175,2,14,150,375,50,8750,2,1125,450,2625,2,4375,2,315,
%U A379493 42,1875,2,11025,15,350,750,1575,2,245,450,441,2250,21,2,42875,2,63,630,294,250,6125,2,39375,3750,3675,2,14406
%N A379493 a(n) = A276086(A001065(n)), where A276086 is the primorial base exp-function, and A001065 is the sum of proper divisors of n.
%H A379493 Antti Karttunen, <a href="/A379493/b379493.txt">Table of n, a(n) for n = 1..30030</a>
%H A379493 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>.
%H A379493 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>.
%o A379493 (PARI)
%o A379493 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A379493 A379493(n) = A276086(sigma(n)-n);
%Y A379493 Cf. A001065, A276086, A379494.
%K A379493 nonn
%O A379493 1,2
%A A379493 _Antti Karttunen_, Jan 05 2025