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.

A376398 a(n) = A276085(n!), where A276085 is the primorial base log-function.

This page as a plain text file.
%I A376398 #8 Oct 28 2024 16:23:43
%S A376398 0,1,3,5,11,14,44,47,51,58,268,272,2582,2613,2621,2625,32655,32660,
%T A376398 543170,543178,543210,543421,10243111,10243116,10243128,10245439,
%U A376398 10245445,10245477,233338347,233338356,6703031586,6703031591,6703031803,6703061834,6703061870,6703061876,207263552006,207264062517,207264064829,207264064838
%N A376398 a(n) = A276085(n!), where A276085 is the primorial base log-function.
%H A376398 Antti Karttunen, <a href="/A376398/b376398.txt">Table of n, a(n) for n = 1..2310</a>
%H A376398 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>
%H A376398 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%F A376398 a(n) = A276085(A000142(n)).
%F A376398 a(n) = Sum_{i=1..n} A276085(i).
%o A376398 (PARI)
%o A376398 A276085(n) = { my(f=factor(n)); sum(k=1, #f~, f[k, 2]*prod(i=1,primepi(f[k, 1]-1),prime(i))); };
%o A376398 A376398(n) = A276085(n!);
%Y A376398 Partial sums of A276085.
%Y A376398 Cf. A000142, A002110.
%Y A376398 Cf. also A143293, A336415, A376397.
%K A376398 nonn
%O A376398 1,3
%A A376398 _Antti Karttunen_, Oct 28 2024