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 A199567 #17 Aug 23 2024 14:53:00 %S A199567 8,64,568,5104,45928,413344,3720088,33480784,301327048,2711943424, %T A199567 24407490808,219667417264,1977006755368,17793060798304, %U A199567 160137547184728,1441237924662544,12971141321962888,116740271897665984,1050662447078993848,9455962023710944624,85103658213398501608 %N A199567 a(n) = 7*9^n + 1. %H A199567 Vincenzo Librandi, <a href="/A199567/b199567.txt">Table of n, a(n) for n = 0..1000</a> %H A199567 <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (10,-9). %F A199567 a(n) = 8*A187709(n). %F A199567 a(n) = 9*a(n-1) - 8 for n > 0. %F A199567 a(n) = 10*a(n-1) - 9*a(n-2) for n > 1. %F A199567 G.f.: 8*(1-2*x)/((1-x)*(1-9*x)). %F A199567 a(n) = 4*(A096046(n) + 1). - _Martin Ettl_, Nov 13 2012 %F A199567 From _Elmo R. Oliveira_, Aug 23 2024: (Start) %F A199567 E.g.f.: exp(x)*(7*exp(8*x) + 1). %F A199567 a(n) = 2*A199566(n). (End) %o A199567 (Magma) [7*9^n+1: n in [0..30]]; %o A199567 (Maxima) A199567(n):=7*9^n+1$ makelist(A199567(n),n,0,30); /* _Martin Ettl_, Nov 13 2012 */ %Y A199567 Cf. A096046, A187709, A199566. %K A199567 nonn,easy %O A199567 0,1 %A A199567 _Vincenzo Librandi_, Nov 08 2011