This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022112 Fibonacci sequence beginning 2 6. 6

%I

%S 2,6,8,14,22,36,58,94,152,246,398,644,1042,1686,2728,4414,7142,11556,

%T 18698,30254,48952,79206,128158,207364,335522,542886,878408,1421294,

%U 2299702,3720996,6020698,9741694

%N Fibonacci sequence beginning 2 6.

%H _Reinhard Zumkeller_, <a href="/A022112/b022112.txt">Table of n, a(n) for n = 0..1000</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rea#recLCC">Index entries for sequences related to linear recurrences with constant coefficients</a>, signature (1,1).

%F a(n)= 4*Fibonacci(n+2)-2*Fibonacci(n+1) [From _Gary Detlefs_ Dec 21 2010]

%F a(n) = 2*A000204(n+1). - R. J. Mathar, Mar 11 2011

%F G.f. ( -2-4*x ) / ( -1+x+x^2 ). - R. J. Mathar, Mar 11 2011]

%F a(n)= Fibonacci(n-2)+ Fibonacci(n+4).- Gary Detlefs, Mar 31 2012

%t a={};b=2;c=6;AppendTo[a,b];AppendTo[a,c];Do[b=b+c;AppendTo[a,b];c=b+c;AppendTo[a,c],{n,1,40,1}];a (Vladimir Orlovsky, Jul 23 2008)

%t LinearRecurrence[{1,1},{2,6},40] (* From Harvey P. Dale, Apr 21 2012 *)

%o a022112 n = a022112_list !! n

%o a022112_list = 2 : 6 : zipWith (+) (tail a022112_list) a022112_list

%o -- _Reinhard Zumkeller_, Apr 08 2012

%K nonn

%O 0,1

%A _N. J. A. Sloane_.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .