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 A029750 #28 Jul 08 2025 19:19:15
%S A029750 1,2,3,4,5,6,7,8,10,12,14,16,20,24,28,32,40,48,56,64,80,96,112,128,
%T A029750 160,192,224,256,320,384,448,512,640,768,896,1024,1280,1536,1792,2048,
%U A029750 2560,3072,3584,4096,5120,6144,7168,8192,10240
%N A029750 List of numbers of the form 2^k times 1, 3, 5 or 7.
%H A029750 Vincenzo Librandi, <a href="/A029750/b029750.txt">Table of n, a(n) for n = 1..1000</a>
%H A029750 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,2).
%F A029750 a(n) = 2a(n-4) for n > 7. - _Charles R Greathouse IV_, Feb 18 2013
%F A029750 G.f.: -x*(x+1)^2*(x^2+1)^2 / (2*x^4-1). - _Colin Barker_, Jul 19 2013
%F A029750 Sum_{n>=1} 1/a(n) = 352/105. - _Amiram Eldar_, Feb 18 2021
%t A029750 CoefficientList[Series[-(x + 1)^2 (x^2 + 1)^2/(2 x^4 - 1), {x, 0, 50}], x] (* _Vincenzo Librandi_, Oct 19 2013 *)
%t A029750 LinearRecurrence[{0,0,0,2},{1,2,3,4,5,6,7},50] (* _Harvey P. Dale_, Aug 24 2019 *)
%o A029750 (PARI) a(n)=if(n<9,n,[4,5,6,7][n%4+1]<<(n\4-1)) \\ _Charles R Greathouse IV_, Feb 18 2013
%K A029750 nonn,easy
%O A029750 1,2
%A A029750 _N. J. A. Sloane_
%E A029750 More terms from _Colin Barker_, Jul 19 2013