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.
%I A369698 #16 Jan 30 2024 06:25:17 %S A369698 0,49,40824,96461056,571250390625,7338413252698641, %T A369698 181953686508203782144,7957561391610438862503936, %U A369698 572547082070592542500791107625,64157961305703333114506988525390625,10714350425499230222239742740718898118656,2571996060859292513876561308464753498396819456 %N A369698 AGM transform of positive cubes. %C A369698 See A368366 for the description of the AGM transform. %H A369698 Paolo Xausa, <a href="/A369698/b369698.txt">Table of n, a(n) for n = 1..120</a> %F A369698 a(n) = A000537(n)^n - A000312(n)*A000442(n). %t A369698 A369698[n_] := (n*(n+1)/2)^(2*n) - n^n*n!^3; Array[A369698, 15] %o A369698 (Python) %o A369698 from math import factorial %o A369698 def A369698(n): return ((n*(n+1))**(m:=n<<1)>>m) - n**n*factorial(n)**3 # _Chai Wah Wu_, Jan 29 2024 %Y A369698 Cf. A368366, A368368. %Y A369698 Cf. A000312, A000442, A000537. %K A369698 nonn %O A369698 1,2 %A A369698 _Paolo Xausa_, Jan 29 2024