Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025169
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025169 a(n)=2F(2n+2), where F=A000045 (the Fibonacci sequence). +0
4
2, 6, 16, 42, 110, 288, 754, 1974, 5168, 13530, 35422, 92736, 242786, 635622, 1664080, 4356618, 11405774, 29860704, 78176338, 204668310, 535828592, 1402817466, 3672623806, 9615053952, 25172538050, 65902560198, 172535142544 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

G.f.: 2/(1-3x+x^2). a(n)=3a(n-1)-a(n-2).

PROGRAM

(PARI) a(n)=2*fibonacci(2*n+2)

CROSSREFS

A025169(n)=2*A001906(n+1).

Adjacent sequences: A025166 A025167 A025168 this_sequence A025170 A025171 A025172

Sequence in context: A074405 A068786 A102699 this_sequence A111282 A115730 A003142

KEYWORD

nonn

AUTHOR

w.meeussen (wouter.meeussen(AT)pandora.be)

EXTENSIONS

Better description from Michael Somos

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research