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.

A325794 Number of divisors of n minus the sum of prime indices of n.

This page as a plain text file.
%I A325794 #8 May 28 2019 19:38:57
%S A325794 1,1,0,1,-1,1,-2,1,-1,0,-3,2,-4,-1,-1,1,-5,1,-6,1,-2,-2,-7,3,-3,-3,-2,
%T A325794 0,-8,2,-9,1,-3,-4,-3,3,-10,-5,-4,2,-11,1,-12,-1,-1,-6,-13,4,-5,-1,-5,
%U A325794 -2,-14,1,-4,1,-6,-7,-15,5,-16,-8,-2,1,-5,0,-17,-3,-7
%N A325794 Number of divisors of n minus the sum of prime indices of n.
%C A325794 A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798, with sum A056239(n).
%H A325794 Antti Karttunen, <a href="/A325794/b325794.txt">Table of n, a(n) for n = 1..10000</a>
%F A325794 a(n) = A000005(n) - A056239(n).
%t A325794 Table[DivisorSigma[0,n]-Total[Cases[FactorInteger[n],{p_,k_}:>PrimePi[p]*k]],{n,100}]
%o A325794 (PARI)
%o A325794 A056239(n) = { my(f); if(1==n, 0, f=factor(n); sum(i=1, #f~, f[i,2] * primepi(f[i,1]))); }
%o A325794 A325794(n) = (numdiv(n)-A056239(n)); \\ _Antti Karttunen_, May 26 2019
%Y A325794 Positions of positive terms are A325795.
%Y A325794 Positions of nonnegative terms are A325796.
%Y A325794 Positions of negative terms are A325797.
%Y A325794 Positions of nonpositive terms are A325798.
%Y A325794 Positions of 1's are A325792.
%Y A325794 Positions of 0's are A325793.
%Y A325794 Positions of -1's are A325694.
%Y A325794 Cf. A000005, A002033, A056239, A112798, A299702, A325780, A325781.
%K A325794 sign,look,hear
%O A325794 1,7
%A A325794 _Gus Wiseman_, May 23 2019