|
|
A187284
|
|
a(n) = round(log(lcm(1,...,n))) - n.
|
|
1
|
|
|
0, -1, -1, -1, -2, -1, -2, -1, -1, -1, -2, -1, -2, 0, -1, -2, -3, -1, -2, 0, -1, -2, -3, -1, -2, -1, -2, -2, -3, -1, -2, 1, 1, 0, -1, -2, -3, -1, -2, -3, -4, -1, -2, 1, 0, -1, -2, 1, 0, 0, -1, -2, -3, 0, -1, -2, -3, -4, -5, -1, -2, 1, 0, -1, -2, -3, -4, 0, -1, -2, -3, 0, -1, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
COMMENTS
|
The prime number theorem implies that lcm(1,2,...,n) = exp(n(1+o(1))) as n -> infinity.
The sequence seems to exhibit significant unpredictability.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
lcm(1,2,...20)=232792560, log(232792560)=19.2657, round(19.2657-20)=-1, so a(20)=-1.
|
|
MATHEMATICA
|
nn=1000; Round[Flatten[{Log /@ FoldList[LCM, 1, Range@nn] - Range[0, nn}]]
Join[{0}, Table[Round[Log[LCM@@Range[n]]]-n, {n, 80}]] (* Harvey P. Dale, Jan 08 2020 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|