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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A199110 a(n) = 7*3^n+1. 1
 8, 22, 64, 190, 568, 1702, 5104, 15310, 45928, 137782, 413344, 1240030, 3720088, 11160262, 33480784, 100442350, 301327048, 903981142, 2711943424, 8135830270, 24407490808, 73222472422, 219667417264, 659002251790, 1977006755368, 5931020266102 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (4,-3). FORMULA a(n) = 3*a(n-1)-2. a(n) = 4*a(n-1)-3*a(n-2). G.f.: 2*(4-5*x)/((1-x)*(1-3*x)). a(n) = 2*A199109(n). - Bruno Berselli, Nov 03 2011 PROG (Magma) [7*3^n+1: n in [0..30]]; (Python) def a(n): return 7*3**n + 1 print([a(n) for n in range(26)]) # Michael S. Branicky, Aug 22 2021 CROSSREFS Cf. A005032, A199109. Sequence in context: A126362 A140418 A200081 * A083098 A322070 A033456 Adjacent sequences: A199107 A199108 A199109 * A199111 A199112 A199113 KEYWORD nonn,easy AUTHOR Vincenzo Librandi, Nov 03 2011 STATUS approved

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.

Last modified December 2 20:20 EST 2023. Contains 367526 sequences. (Running on oeis4.)