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 A169963 #19 Jun 26 2024 04:05:14
%S A169963 5,46,452,4504,45008,450016,4500032,45000064,450000128,4500000256,
%T A169963 45000000512,450000001024,4500000002048,45000000004096,
%U A169963 450000000008192,4500000000016384,45000000000032768,450000000000065536,4500000000000131072,45000000000000262144
%N A169963 Number of (2n+1)-digit squares in carryless arithmetic mod 10.
%H A169963 David Applegate, Marc LeBrun and N. J. A. Sloane, <a href="http://neilsloane.com/doc/carry1.pdf">Carryless Arithmetic (I): The Mod 10 Version</a>.
%H A169963 <a href="/index/Ca#CARRYLESS">Index entries for sequences related to carryless arithmetic</a>
%H A169963 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (12,-20).
%F A169963 For formula see Maple code.
%F A169963 a(n) = 12*a(n-1)-20*a(n-2). G.f.: -(14*x-5) / ((2*x-1)*(10*x-1)). - _Colin Barker_, May 11 2013
%p A169963 f :- n->2^((n-1)/2) + add( 5^d*2^((n+1)/2),d=0..(n-3)/2) + 2^((n+3)/2)*5^((n-1)/2);
%t A169963 LinearRecurrence[{12, -20}, {5, 46}, 25] (* _Paolo Xausa_, Jun 26 2024 *)
%Y A169963 See A059729 for the actual squares.
%K A169963 nonn,base,easy
%O A169963 0,1
%A A169963 _N. J. A. Sloane_, Aug 07 2010