STATUS
proposed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
proposed
approved
editing
proposed
(Python) # generates initial segment of sequence
from math import gcd
from itertools import accumulate
def lcm(a, b): return a * b // gcd(a, b)
def aupton(nn):
lcm1 = accumulate(range(1, nn), lcm)
lcm2 = [lcm(k, n+1) for n, k in enumerate(lcm1, start=2)]
return [m*(m%n != 0) for n, m in enumerate(lcm2, start=2)]
print(aupton(42)) # Michael S. Branicky, Jun 25 2021
proposed
editing
editing
proposed
Table[If[Mod[l=LCM@@Join[Range[n-1], {n+1}], n]==0, 0, l], {n, 2, 50}] (* Giorgos Kalogeropoulos, Jun 25 2021 *)
proposed
editing
editing
proposed
Probably yes. Those are the Fermat numbers minus 1 plus and the number 8, (which is the only power of 2 that's is one less than a square number). - J. Lowell, Jun 08 2021
proposed
editing
editing
proposed
Probably yes. Those are the Fermat numbers minus 1 plus the number 8 (, which is the only power of 2 that's one less than a square number.) _ - _J. Lowell_, Jun 08 2021
proposed
editing
editing
proposed