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 A276764 #58 Mar 02 2023 13:45:12
%S A276764 10,20,74,100,202,244,394,452,650,724,970,1060,1354,1460,1802,1924,
%T A276764 2314,2452,2890,3044,3530,3700,4234,4420,5002,5204,5834,6052,6730,
%U A276764 6964,7690,7940,8714,8980,9802,10084,10954,11252,12170,12484,13450,13780,14794,15140
%N A276764 1^2 + 3^2, 2^2 + 4^2, 5^2 + 7^2, 6^2 + 8^2, ...
%H A276764 Colin Barker, <a href="/A276764/b276764.txt">Table of n, a(n) for n = 1..1000</a>
%H A276764 Quora, <a href="https://www.quora.com/What-is-the-next-number-in-this-sequence-10-20-74-100">What is the next number in this sequence: 10, 20, 74, 100?</a>
%H A276764 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,2,-2,-1,1).
%F A276764 a(n) = (2n - 1 - ((n+1) mod 2))^2 + (2n + (n mod 2))^2.
%F A276764 From _Colin Barker_, Nov 10 2016: (Start)
%F A276764 G.f.: 2*x*(5 + 5*x + 17*x^2 + 3*x^3 + 2*x^4) / ((1 - x)^3 * (1 + x)^2).
%F A276764 a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5) for n>5.
%F A276764 a(n) = 8*n^2 - 8*n + 4 for n even.
%F A276764 a(n) = 8*n^2 + 2 for n odd.
%F A276764 (End)
%t A276764 LinearRecurrence[{1,2,-2,-1,1},{10,20,74,100,202},50] (* _Harvey P. Dale_, Mar 02 2023 *)
%o A276764 (PARI) Vec(2*x*(5+5*x+17*x^2+3*x^3+2*x^4) / ((1-x)^3*(1+x)^2) + O(x^60)) \\ _Colin Barker_, Nov 10 2016
%Y A276764 Cf. A001844.
%K A276764 nonn,easy
%O A276764 1,1
%A A276764 _Edwin McCravy_, Nov 06 2016