Search: id:A129972
Results 1-1 of 1 results found.

%I A129972
%S A129972 1,3,3,5,5,5,5,7,7,7,7,7,7,7,7,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,11,11,11,
%T A129972 11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,
%U A129972 11,11,11,11,11,11,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13
%N A129972 a(n)=sum(k=1,n,(-1)^(k-1)*floor(n/k)*mu(k)).
%C A129972 Consists of the n-th odd number (A005408(n) = 2n+1) repeated 2^(n-1) 
               times (since a(n)=a(n-1) except when a(n)>a(n-1) which happens for 
               n a power of 2). - Jonathan Vos Post (jvospost3(AT)gmail.com), Jun 
               17 2007
%F A129972 a(n)=2*floor(log(n)/log(2))+1
%o A129972 (PARI) a(n)=2*floor(log(n)/log(2))+1
%Y A129972 Cf. A005408.
%Y A129972 Sequence in context: A071182 A136027 A133772 this_sequence A130829 A035158 
               A123313
%Y A129972 Adjacent sequences: A129969 A129970 A129971 this_sequence A129973 A129974 
               A129975
%K A129972 nonn
%O A129972 1,2
%A A129972 Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 13 2007

Search completed in 0.001 seconds