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.

A325226 Number of prime factors of n that are less than the largest, counted with multiplicity.

This page as a plain text file.
%I A325226 #10 Nov 17 2019 22:39:17
%S A325226 0,0,0,0,0,1,0,0,0,1,0,2,0,1,1,0,0,1,0,2,1,1,0,3,0,1,0,2,0,2,0,0,1,1,
%T A325226 1,2,0,1,1,3,0,2,0,2,2,1,0,4,0,1,1,2,0,1,1,3,1,1,0,3,0,1,2,0,1,2,0,2,
%U A325226 1,2,0,3,0,1,1,2,1,2,0,4,0,1,0,3,1,1,1,3,0,3,1,2,1,1,1,5,0,1,2,2,0,2,0,3,2
%N A325226 Number of prime factors of n that are less than the largest, counted with multiplicity.
%H A325226 Antti Karttunen, <a href="/A325226/b325226.txt">Table of n, a(n) for n = 1..100000</a>
%F A325226 a(n) = A001222(n/A053585(n)).
%F A325226 a(n) = A001222(n) - A071178(n) = A062977(A108951(n)). - _Antti Karttunen_, Nov 17 2019
%e A325226 The prime factors of 300 are {2,2,3,5,5} of which {2,2,3} are less than the largest, so a(300) = 3.
%t A325226 Table[PrimeOmega[n/Power@@FactorInteger[n][[-1]]],{n,100}]
%o A325226 (PARI)
%o A325226 A071178(n) = if(1==n, 0, factor(n)[omega(n), 2]);
%o A325226 A325226(n) = (bigomega(n) - A071178(n)); \\ _Antti Karttunen_, Nov 17 2019
%Y A325226 Positions of 0's are A000961. Positions of 1's are A325230. Positions of terms > 1 are A307517.
%Y A325226 Cf. A000094, A000245, A001222, A052126, A053585, A061395, A062977, A064989, A071178, A105441, A108951, A256617.
%K A325226 nonn
%O A325226 1,12
%A A325226 _Gus Wiseman_, Apr 12 2019
%E A325226 Data section extended up to term a(105) by _Antti Karttunen_, Nov 17 2019