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 A210446 #29 Oct 13 2019 23:46:42
%S A210446 0,0,0,0,0,6,0,0,16,18,0,30,0,36,48,0,0,70,0,90,96,90,0,126,144,126,
%T A210446 160,180,0,210,0,0,240,216,288,300,0,270,336,378,0,420,0,450,480,396,
%U A210446 0,510,576,594,576,630,0,700,720,756,720,630,0,858,0,720,960,0
%N A210446 Largest integer which is both the product of two integers summing to n+1 and the product of two integers summing to n-1.
%C A210446 a(n) is also the difference between ((n+1)/2)^2 and Q, where Q is the smallest square which exceeds n by a square q (or by 0 if n itself is a square): ((n+1) / 2)^2 - a(n) = Q; Q - n = q; (Q, q squares of an integer if n is odd).
%C A210446 If n is an odd nonprime > 1, a(n)/16 is the product of two triangular numbers (see A085780).
%C A210446 If n is 1, a prime or a power of 2, a(n) = 0.
%F A210446 a(n) = (f1^2 - 1)*(f2^2 - 1)/4 (with f1 and f2 the nearest integers such that f1*f2 = n).
%e A210446 a(15) = 48 because 6*8 = 12*4 = 48 and 6 + 8 = 15 - 1; 12 + 4 = 15 + 1.
%e A210446 a(45) = 480 because 20*24 = 16*30 = 480 and 20 + 24 = 45 - 1; 16 + 30 = 45 + 1.
%e A210446 (Also 448 = 28*16 = 14*32, but 480 is larger.)
%t A210446 a[n_] := Module[{x,y,p}, Max[p /. List@ToRules@Reduce[p == x*(n-1-x) == y*(n+1-y), {x, y, p}, Integers]]]; Table[a[n], {n, 100}] (* _Giovanni Resta_, Jan 22 2013 *)
%o A210446 (PARI) a(n) = {my(x=vector(n\2), y=vector(n\2)); for(k=1, n\2, x[k]=k*(n-1-k); y[k]=k*(n+1-k)); v=setintersect(x, y); if(#v>0, v[#v], 0); } \\ _Jinyuan Wang_, Oct 13 2019
%Y A210446 Cf. A085780.
%K A210446 nonn
%O A210446 1,6
%A A210446 _Enric Reverter i Bigas_, Jan 20 2013