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 A151984 #27 May 19 2019 17:07:52
%S A151984 0,1,64,65,128,129,192,193,256,257,320,321,384,385,448,449,512,513,
%T A151984 576,577,640,641,704,705,768,769,832,833,896,897,960,961,1024,1025,
%U A151984 1088,1089,1152,1153,1216,1217,1280,1281,1344,1345,1408,1409,1472,1473,1536,1537
%N A151984 Numbers that are congruent to {0, 1} mod 64.
%C A151984 Numbers k such that k^2 - k is divisible by 64.
%H A151984 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1).
%F A151984 a(n+1) = Sum_{k>=0} A030308(n,k)*b(k) with b(0)=1, b(k)=2^(n+5) for k > 0. - _Philippe Deléham_, Oct 17 2011
%F A151984 From _Colin Barker_, Nov 29 2012: (Start)
%F A151984 a(n) = (-95 - 31*(-1)^n + 64*n)/2.
%F A151984 a(n) = a(n-1) + a(n-2) - a(n-3).
%F A151984 G.f.: x^2*(63*x+1)/((x-1)^2*(x+1)). (End)
%t A151984 Flatten[{#,#+1}&/@(64 Range[30])] (* _Harvey P. Dale_, Feb 01 2011 *)
%o A151984 (PARI) forstep(n=0,400,[1,63],print1(n", ")) \\ _Charles R Greathouse IV_, Oct 17 2011
%K A151984 nonn,easy
%O A151984 1,3
%A A151984 _N. J. A. Sloane_, Aug 23 2009