login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047790 Fibonacci(2*n)-2^n+1. 1
0, 0, 0, 1, 6, 24, 81, 250, 732, 2073, 5742, 15664, 42273, 113202, 301428, 799273, 2112774, 5571816, 14668209, 38563882, 101285580, 265817145, 697214430, 1827923296, 4790749761, 12552714594, 32884171236, 86133353545, 225582998262 (list; graph; refs; listen; history; internal format)
OFFSET

0,5

FORMULA

a(0)=0, a(1)=0, a(2)=0, a(3)=1, a(n)=6*a(n-1)-12*a(n-2)+ 9*a(n-3)- 2*a(n-4) [From Harvey P. Dale, Jan 19 2012]

MAPLE

with(combstruct): SeqSeqSeqL := [T, {T=Sequence(S, card > 1), S=Sequence(U, card > 1), U=Sequence(Z, card >0)}, unlabeled]: seq(count(SeqSeqSeqL, size=j), j=1..29); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 16 2009]

MATHEMATICA

Table[Fibonacci[2n]-2^n+1, {n, 0, 30}] (* or *) LinearRecurrence[ {6, -12, 9, -2}, {0, 0, 0, 1}, 30] (* From Harvey P. Dale, Jan 19 2012 *)

PROG

sage: [lucas_number1(n, 3, 1)-lucas_number1(n, 3, 2) for n in xrange(0, 30)] - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 06 2008

CROSSREFS

Sequence in context: A201189 A001788 A068711 * A133474 A052150 A118043

Adjacent sequences:  A047787 A047788 A047789 * A047791 A047792 A047793

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 .

Last modified February 16 02:51 EST 2012. Contains 205860 sequences.