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 A158938 #15 Apr 19 2023 02:27:29
%S A158938 -3,7,9,11,13,23,25,27,61,71,73,75,77,87,89,91,125,135,137,139,141,
%T A158938 151,153,155,189,199,201,203,205,215,217,219,253,263,265,267,269,279,
%U A158938 281,283,317,327,329,331,333,343,345,347,381,391,393,395,397,407,409,411
%N A158938 Numbers congruent to {-3,7,9,11,13,23,25,27} mod 64.
%C A158938 When will this first differ from A103621?
%H A158938 Colin Barker, <a href="/A158938/b158938.txt">Table of n, a(n) for n = 0..1000</a>
%H A158938 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,1,-1).
%F A158938 a(n) = a(n-8) + 64.
%F A158938 From _Colin Barker_, Oct 14 2019: (Start)
%F A158938 G.f.: -(3 - 10*x - 2*x^2 - 2*x^3 - 2*x^4 - 10*x^5 - 2*x^6 - 2*x^7 - 37*x^8) / ((1 - x)^2*(1 + x)*(1 + x^2)*(1 + x^4)).
%F A158938 a(n) = a(n-1) + a(n-8) - a(n-9) for n>8.
%F A158938 (End)
%t A158938 Select[Range[-5,500],MemberQ[{7,9,11,13,23,25,27,61},Mod[#,64]]&] (* or *) LinearRecurrence[{1,0,0,0,0,0,0,1,-1},{-3,7,9,11,13,23,25,27,61},60] (* _Harvey P. Dale_, Jul 26 2021 *)
%Y A158938 Cf. A103621.
%K A158938 sign,easy
%O A158938 0,1
%A A158938 _Philippe Deléham_, Mar 31 2009