cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A051418 Square of LCM of {1, 2, ..., n}.

This page as a plain text file.
%I A051418 #21 Oct 27 2023 22:00:44
%S A051418 1,4,36,144,3600,3600,176400,705600,6350400,6350400,768398400,
%T A051418 768398400,129859329600,129859329600,129859329600,519437318400,
%U A051418 150117385017600,150117385017600,54192375991353600,54192375991353600,54192375991353600,54192375991353600
%N A051418 Square of LCM of {1, 2, ..., n}.
%C A051418 a(n) is the least common multiple (or LCM) of {1, 4, 9, 16, ..., n^2}.
%H A051418 T. D. Noe, <a href="/A051418/b051418.txt">Table of n, a(n) for n = 1..200</a>
%H A051418 Jon T. Butler, Tsutomu Sasao, <a href="https://doi.org/10.1109/ISMVL.2019.00032">Realizing all Index Generation Functions by the Row-Shift Method</a>, IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL 2019).
%H A051418 <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a>
%F A051418 a(n) = A003418(n)^2.
%e A051418 a(5) = lcm {1, 4, 9, 16, 25} = 3600.
%t A051418 Table[LCM@@Range[n],{n,20}]^2  (* _Harvey P. Dale_, Mar 28 2011 *)
%o A051418 (Python) # generator of sequence
%o A051418 from math import lcm
%o A051418 from itertools import accumulate, count, islice
%o A051418 def sqr(x): return x*x
%o A051418 def agen(): yield from map(sqr, accumulate(count(1), lcm))
%o A051418 print(list(islice(agen(), 22))) # _Michael S. Branicky_, Oct 04 2022
%Y A051418 Cf. A003418.
%K A051418 easy,nice,nonn
%O A051418 1,2
%A A051418 _Asher Auel_