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.

A325797 Numbers with fewer divisors than the sum of their prime indices.

This page as a plain text file.
%I A325797 #4 May 23 2019 14:49:38
%S A325797 5,7,9,11,13,14,15,17,19,21,22,23,25,26,27,29,31,33,34,35,37,38,39,41,
%T A325797 43,44,45,46,47,49,50,51,52,53,55,57,58,59,61,62,63,65,67,68,69,71,73,
%U A325797 74,75,76,77,78,79,81,82,83,85,86,87,89,91,92,93,94,95,97
%N A325797 Numbers with fewer divisors than the sum of their prime indices.
%C A325797 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).
%e A325797 The sequence of terms together with their prime indices begins:
%e A325797    5: {3}
%e A325797    7: {4}
%e A325797    9: {2,2}
%e A325797   11: {5}
%e A325797   13: {6}
%e A325797   14: {1,4}
%e A325797   15: {2,3}
%e A325797   17: {7}
%e A325797   19: {8}
%e A325797   21: {2,4}
%e A325797   22: {1,5}
%e A325797   23: {9}
%e A325797   25: {3,3}
%e A325797   26: {1,6}
%e A325797   27: {2,2,2}
%e A325797   29: {10}
%e A325797   31: {11}
%e A325797   33: {2,5}
%e A325797   34: {1,7}
%e A325797   35: {3,4}
%t A325797 Select[Range[100],DivisorSigma[0,#]<Total[Cases[FactorInteger[#],{p_,k_}:>PrimePi[p]*k]]&]
%Y A325797 Positions of negative terms in A325794.
%Y A325797 Heinz numbers of the partitions counted by A325833.
%Y A325797 Cf. A000005, A002033, A056239, A112798, A299702.
%Y A325797 Cf. A325694, A325780, A325781, A325792, A325793, A325795, A325796, A325798.
%K A325797 nonn
%O A325797 1,1
%A A325797 _Gus Wiseman_, May 23 2019