[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A199567 a(n) = 7*9^n + 1. 2

%I #17 Aug 23 2024 14:53:00

%S 8,64,568,5104,45928,413344,3720088,33480784,301327048,2711943424,

%T 24407490808,219667417264,1977006755368,17793060798304,

%U 160137547184728,1441237924662544,12971141321962888,116740271897665984,1050662447078993848,9455962023710944624,85103658213398501608

%N a(n) = 7*9^n + 1.

%H Vincenzo Librandi, <a href="/A199567/b199567.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (10,-9).

%F a(n) = 8*A187709(n).

%F a(n) = 9*a(n-1) - 8 for n > 0.

%F a(n) = 10*a(n-1) - 9*a(n-2) for n > 1.

%F G.f.: 8*(1-2*x)/((1-x)*(1-9*x)).

%F a(n) = 4*(A096046(n) + 1). - _Martin Ettl_, Nov 13 2012

%F From _Elmo R. Oliveira_, Aug 23 2024: (Start)

%F E.g.f.: exp(x)*(7*exp(8*x) + 1).

%F a(n) = 2*A199566(n). (End)

%o (Magma) [7*9^n+1: n in [0..30]];

%o (Maxima) A199567(n):=7*9^n+1$ makelist(A199567(n),n,0,30); /* _Martin Ettl_, Nov 13 2012 */

%Y Cf. A096046, A187709, A199566.

%K nonn,easy,changed

%O 0,1

%A _Vincenzo Librandi_, Nov 08 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 1 11:12 EDT 2024. Contains 375589 sequences. (Running on oeis4.)