login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051844 a(n) = LCM_{k=0..n} (2^k + 1). 2
2, 6, 30, 90, 1530, 16830, 218790, 9407970, 2417848290, 137817352530, 28252557268650, 19296496614487950, 4650455684091595950, 12700394473254148539450, 41619192688853844763777650, 13775952780010622616810402150, 902834617343556174437903325704550 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
FORMULA
a(n) = lcm(2, 3, 5, ..., 2^n + 1).
Product_{k=1..n} cyclotomic(2*k-2, 2). - Vladeta Jovovic, Apr 05 2004
EXAMPLE
a(3) = lcm(2, 3, 5) = 30.
MATHEMATICA
Module[{nn=20, c}, c=Table[2^n+1, {n, 0, nn}]; Table[LCM@@Take[c, n], {n, nn}]] (* Harvey P. Dale, Aug 04 2017 *)
PROG
(PARI) a(n) = {ret = 1; for (k=0, n, ret = lcm(ret, 2^k+1)); return(ret); } \\ Michel Marcus, May 24 2013
(Python)
from math import lcm
from itertools import accumulate
def aupton(nn): return list(accumulate((2**k+1 for k in range(nn+1)), lcm))
print(aupton(16)) # Michael S. Branicky, Jul 04 2022
CROSSREFS
Cf. A034268.
Cf. A019320.
Sequence in context: A290760 A088857 A099081 * A335396 A034501 A203461
KEYWORD
nonn
AUTHOR
Jeffrey Shallit, Apr 20 2000
EXTENSIONS
More terms from Harvey P. Dale, Aug 04 2017
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 10 19:44 EST 2023. Contains 367717 sequences. (Running on oeis4.)