cp's OEIS Frontend

A025548 a(n) = sum of the exponents in the prime factorization of the least common multiple of {1,3,5,...,2n-1}.

%I A025548 #12 Dec 26 2024 14:37:01
%S A025548 0,1,2,3,4,5,6,6,7,8,8,9,10,11,12,13,13,13,14,14,15,16,16,17,18,18,19,
%T A025548 19,19,20,21,21,21,22,22,23,24,24,24,25,26,27,27,27,28,28,28,28,29,29,
%U A025548 30,31,31,32,33,33,34,34,34,34,35,35,36,37,37,38,38,38,39,40,40,40,40
%N A025548 a(n) = sum of the exponents in the prime factorization of the least common multiple of {1,3,5,...,2n-1}.
%H A025548 Robert Israel, <a href="/A025548/b025548.txt">Table of n, a(n) for n = 1..10000</a>
%F A025548 a(n) = A001222(A025547(n)).
%p A025548 N:= 100: # for a(1) .. a(N)
%p A025548 V:= Vector(N):
%p A025548 p:= 2:
%p A025548 do
%p A025548   p:= nextprime(p);
%p A025548   if p > 2*N-1 then break fi;
%p A025548   J:= [seq((p^i+1)/2, i = 1 .. ilog[p](2*N-1))];
%p A025548   V[J]:= V[J] +~ 1;
%p A025548 od:
%p A025548 ListTools:-PartialSums(convert(V,list)); # _Robert Israel_, Dec 26 2024
%Y A025548 Cf. A001222, A025547.
%K A025548 nonn
%O A025548 1,3
%A A025548 _Clark Kimberling_
%E A025548 Corrected and extended by _Ray Chandler_, May 01 2007