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 A064746 #27 May 04 2025 14:44:14
%S A064746 1,9,129,1537,16385,163841,1572865,14680065,134217729,1207959553,
%T A064746 10737418241,94489280513,824633720833,7146825580545,61572651155457,
%U A064746 527765581332481,4503599627370497,38280596832649217,324259173170675713,2738188573441261569,23058430092136939521
%N A064746 a(n) = n*8^n + 1.
%H A064746 Harry J. Smith, <a href="/A064746/b064746.txt">Table of n, a(n) for n = 0..150</a>
%H A064746 Paul Leyland, <a href="http://www.leyland.vispa.com/numth/factorization/cullen_woodall/cw.htm">Factors of Cullen and Woodall numbers</a>.
%H A064746 Paul Leyland, <a href="http://www.leyland.vispa.com/numth/factorization/cullen_woodall/gcw.htm">Generalized Cullen and Woodall numbers</a>.
%H A064746 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (17,-80,64).
%F A064746 a(n) = 17*a(n-1) - 80*a(n-2) + 64*a(n-3), a(0)=1, a(1)=9, a(2)=129. - _Harvey P. Dale_, Jul 24 2012
%F A064746 G.f.: -(56*x^2-8*x+1)/((x-1)*(8*x-1)^2). - _Colin Barker_, Oct 15 2012
%F A064746 From _Elmo R. Oliveira_, May 04 2025: (Start)
%F A064746 E.g.f.: exp(x)*(1 + 8*x*exp(7*x)).
%F A064746 a(n) = A036294(n) + 1. (End)
%t A064746 Table[n*8^n+1,{n,0,20}] (* or *) LinearRecurrence[{17,-80,64},{1,9,129},20] (* _Harvey P. Dale_, Jul 24 2012 *)
%o A064746 (PARI) a(n) = { n*8^n + 1 } \\ _Harry J. Smith_, Sep 24 2009
%Y A064746 Cf. A002064, A036294.
%K A064746 nonn,easy
%O A064746 0,2
%A A064746 _N. J. A. Sloane_, Oct 19 2001