# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a329339
Showing 1-1 of 1

%I A329339 #13 Nov 14 2019 13:40:12
%S A329339 1,6,42,60,139810,126,139620524162,2040,349524,699050,
%T A329339 2537779500750160131246576896002,16380,
%U A329339 44612382091907903486070965589630128805126146,1256584717458,153722867280912930,1048560,231587712222682663714935471840371426842813815977643091627066215779128553111554,1048572
%N A329339 a(n) = 2^A051903(n)*Sum_{k=0..n-1} 2^(A268336(n)*k): upper bound for A329000(n).
%C A329339 This corresponds to the upper bound for A329000 as explained in the "FORMULA" for A329126.
%C A329339 Differs from A329000(n) for n = 10, 14, 15, ...
%F A329339 a(n) = 2^A051903(n)*(m^n-1)/(m-1) with m = 2^A268336(n).
%o A329339 (PARI) apply( A329339(n)={my(m=2^(lcm(lcm(znstar(n)[2]),n)/n)); (m^n-1)\(m-1)<<if(n>1,vecmax(factor(n)[,2]))}, [1..20])
%Y A329339 Cf. A329000, A329126, A329338 (a(n) written in binary), A067029, A051903.
%K A329339 nonn
%O A329339 1,2
%A A329339 _M. F. Hasler_, Nov 13 2019

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE