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

%I #12 Dec 26 2024 14:37:01

%S 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 19,19,20,21,21,21,22,22,23,24,24,24,25,26,27,27,27,28,28,28,28,29,29,

%U 30,31,31,32,33,33,34,34,34,34,35,35,36,37,37,38,38,38,39,40,40,40,40

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

%H Robert Israel, <a href="/A025548/b025548.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A001222(A025547(n)).

%p N:= 100: # for a(1) .. a(N)

%p V:= Vector(N):

%p p:= 2:

%p do

%p p:= nextprime(p);

%p if p > 2*N-1 then break fi;

%p J:= [seq((p^i+1)/2, i = 1 .. ilog[p](2*N-1))];

%p V[J]:= V[J] +~ 1;

%p od:

%p ListTools:-PartialSums(convert(V,list)); # _Robert Israel_, Dec 26 2024

%Y Cf. A001222, A025547.

%K nonn

%O 1,3

%A _Clark Kimberling_

%E Corrected and extended by _Ray Chandler_, May 01 2007