The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A329339 a(n) = 2^A051903(n)*Sum_{k=0..n-1} 2^(A268336(n)*k): upper bound for A329000(n). 3
 1, 6, 42, 60, 139810, 126, 139620524162, 2040, 349524, 699050, 2537779500750160131246576896002, 16380, 44612382091907903486070965589630128805126146, 1256584717458, 153722867280912930, 1048560, 231587712222682663714935471840371426842813815977643091627066215779128553111554, 1048572 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 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, ... LINKS FORMULA a(n) = 2^A051903(n)*(m^n-1)/(m-1) with m = 2^A268336(n). PROG (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]) CROSSREFS Cf. A329000, A329126, A329338 (a(n) written in binary), A067029, A051903. Sequence in context: A083938 A292316 A329000 * A176308 A103763 A191764 Adjacent sequences:  A329336 A329337 A329338 * A329340 A329341 A329342 KEYWORD nonn AUTHOR M. F. Hasler, Nov 13 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 4 10:43 EDT 2020. Contains 334825 sequences. (Running on oeis4.)