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!)
A171479 a(n) = 6*a(n-1)-8*a(n-2)+3 for n > 1; a(0) = 1, a(1) = 8. 1
1, 8, 43, 197, 841, 3473, 14113, 56897, 228481, 915713, 3666433, 14672897, 58705921, 234852353, 939466753, 3757981697, 15032156161, 60129083393, 240517251073, 962070839297, 3848287027201, 15393155448833, 61572636475393 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = (2-7*2^n+7*4^n)/2.
G.f.: (1+x+x^2)/((1-x)*(1-2*x)*(1-4*x)).
MAPLE
A171479:=n->(2-7*2^n+7*4^n)/2: seq(A171479(n), n=0..30); # Wesley Ivan Hurt, Apr 28 2017
MATHEMATICA
LinearRecurrence[{7, -14, 8}, {1, 8, 43}, 30] (* Harvey P. Dale, Sep 18 2022 *)
PROG
(PARI) {m=23; v=concat([1, 8], vector(m-2)); for(n=3, m, v[n]=6*v[n-1]-8*v[n-2]+3); v}
(Magma) [(2-7*2^n+7*4^n)/2: n in [0..30]]; // Vincenzo Librandi, Jul 18 2011
CROSSREFS
Sequence in context: A005024 A094865 A122880 * A227209 A282523 A099253
KEYWORD
nonn,easy
AUTHOR
Klaus Brockhaus, Dec 09 2009
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:27 EDT 2024. Contains 371971 sequences. (Running on oeis4.)