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 A377851 #45 Dec 07 2024 14:57:16
%S A377851 8,1,24,8,40,3,56,16,72,5,88,24,104,7,120,32,136,9,152,40,168,11,184,
%T A377851 48,200,13,216,56,232,15,248,64,264,17,280,72,296,19,312,80,328,21,
%U A377851 344,88,360,23,376,96,392,25,408,104,424,27,440,112,456,29,472
%N A377851 Smallest multiplier which can complete the square for n-polygonal numbers, together with a constant offset.
%C A377851 This smallest multiplier is also the only multiplier that is relatively prime to the offset.
%C A377851 The n-polygonal numbers, indexed by x, are P(n,x) = (n-2)*(x-1)*x/2 + x = A139601(n-3,x).
%C A377851 S(x) = P(n,x)*a(n) + A181318(n-4) completes the square in that quadratic, ensuring S(x) is a square for all x.
%H A377851 Paolo Xausa, <a href="/A377851/b377851.txt">Table of n, a(n) for n = 3..10000</a>
%H A377851 Wikipedia, <a href="https://en.wikipedia.org/wiki/Completing_the_square">Completing the square</a>.
%H A377851 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,2,0,0,0,-1).
%F A377851 a(n) = 8*(n-2)/gcd(n,4)^2. - _Andrew Howroyd_, Nov 10 2024
%F A377851 From _Stefano Spezia_, Nov 13 2024: (Start)
%F A377851 G.f.: x^3*(8 + x + 24*x^2 + 8*x^3 + 24*x^4 + x^5 + 8*x^6)/(1 - x^4)^2.
%F A377851 E.g.f.: (4 + 32*x + 6*cos(x) + 2*(16*x - 5)*cosh(x) + 3*x*sin(x) + (5*x - 64)*sinh(x))/4. (End)
%e A377851 For n=7, the heptagonal numbers are h(x) = x*(5*x-3)/2 and with multiplier a(7) = 40 and offset A181318(7-4) = 9 become 40*h(x)+9 = (10*x - 3)^2.
%t A377851 Table[8*(n - 2)/GCD[n, 4]^2, {n, 3, 100}] (* _Paolo Xausa_, Dec 07 2024 *)
%o A377851 (PARI) a(n) = 8*(n-2)/gcd(n,4)^2 \\ _Andrew Howroyd_, Nov 10 2024
%Y A377851 Cf. A181318 (offsets).
%K A377851 nonn,easy
%O A377851 3,1
%A A377851 _Jonathan Dushoff_, Nov 09 2024