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 A362374 #42 May 29 2024 06:58:46
%S A362374 4,4,4,24,24,64,144,224,544,1024,1984,4224,8064,16384,33024,65024,
%T A362374 131584,262144,523264,1050624,2095104,4194304,8392704,16769024,
%U A362374 33562624,67108864,134201344,268468224,536838144,1073741824,2147549184,4294836224,8590065664
%N A362374 Number of solutions of y^2 + y = x^3 + x where x and y are in GF(2^n).
%H A362374 Paolo Xausa, <a href="/A362374/b362374.txt">Table of n, a(n) for n = 1..1000</a>
%H A362374 John C. Baez, <a href="https://arxiv.org/abs/2304.08737">Motivating Motives</a>, arXiv:2304.08737 [math.NT], 2023. See pp. 4-5.
%H A362374 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0,2,4).
%F A362374 a(n) = 4 * A038518(n). - _Joerg Arndt_, Apr 20 2023
%F A362374 From _Stefano Spezia_, May 28 2024: (Start)
%F A362374 G.f.: 4*x*(1 + x - x^2)/((1 - 2*x)*(1 + 2*x + 2*x^2)).
%F A362374 E.g.f.: 2*cosh(x)*(cosh(x) - cos(x)) + 2*(cosh(x) + cos(x))*sinh(x). (End)
%t A362374 LinearRecurrence[{0, 2, 4}, {4, 4, 4}, 50] (* _Paolo Xausa_, May 28 2024 *)
%Y A362374 Cf. A038518.
%K A362374 nonn,easy
%O A362374 1,1
%A A362374 _Michel Marcus_, Apr 20 2023