A329339 a(n) = 2^A051903(n)*Sum_{k=0..n-1} 2^(A268336(n)*k): upper bound for A329000(n).

1, 6, 42, 60, 139810, 126, 139620524162, 2040, 349524, 699050, 2537779500750160131246576896002, 16380, 44612382091907903486070965589630128805126146, 1256584717458, 153722867280912930, 1048560, 231587712222682663714935471840371426842813815977643091627066215779128553111554, 1048572

Offset: 1

Author

M. F. Hasler, Nov 13 2019

Keywords

• nonn

Comments

This corresponds to the upper bound for A329000 as explained in the "FORMULA" for A329126.

Differs from A329000(n) for n = 10, 14, 15, ...

Crossrefs

Cf. A329000, A329126, A329338 (a(n) written in binary), A067029, A051903.

Programs

PARI

apply( A329339(n)={my(m=2^(lcm(lcm(znstar(n)[2]),n)/n)); (m^n-1)\(m-1)<1,vecmax(factor(n)[,2]))}, [1..20])

Formula

a(n) = 2^A051903(n)*(m^n-1)/(m-1) with m = 2^A268336(n).