Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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!)
A083878 a(0)=1, a(1)=3, a(n) = 6*a(n-1) - 7*a(n-2), n >= 2. 10
1, 3, 11, 45, 193, 843, 3707, 16341, 72097, 318195, 1404491, 6199581, 27366049, 120799227, 533233019, 2353803525, 10390190017, 45864515427, 202455762443, 893682966669, 3944907462913, 17413664010795, 76867631824379 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Binomial transform of A006012. Second binomial transform of A001333.
Third binomial transform of A077957. Inverse binomial transform of A083879. - Philippe Deléham, Dec 01 2008
LINKS
FORMULA
a(n) = ((3 - sqrt(2))^n + (3 + sqrt(2))^n)/2;
a(n) = Sum_{k=0..n} C(n, 2k)*3^(n-2k)*2^k;
G.f.: (1-3x)/(1-6x+7x^2);
E.g.f.: exp(3x)*cosh(x*sqrt(2)).
a(n) = Sum_{k=0..n} C(n, k)*2^((n-k)/2)(1+(-1)^(n-k))*3^k/2. - Paul Barry, Jan 22 2005
a(n) = Sum_{k=0..n} A098158(n,k)*3^(2k-n)*2^(n-k). - Philippe Deléham, Dec 01 2008
a(n) = A081179(n+1) - 3*A081179(n). - R. J. Mathar, Nov 10 2013
a(n) = Sum_{k=1..n} A056241(n, k) * 2^(k-1). - J. Conrad, Nov 23 2022
MATHEMATICA
f[n_] := Simplify[(3 + Sqrt@2)^n + (3 - Sqrt@2)^n]/2; Array[f, 23, 0] (* Robert G. Wilson v, Oct 31 2010 *)
CROSSREFS
Sequence in context: A238578 A151113 A151114 * A363183 A151115 A151116
KEYWORD
easy,nonn
AUTHOR
Paul Barry, May 08 2003
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 September 8 15:16 EDT 2024. Contains 375753 sequences. (Running on oeis4.)