Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033887
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A033887 Fibonacci(3n+1). +0
31
1, 3, 13, 55, 233, 987, 4181, 17711, 75025, 317811, 1346269, 5702887, 24157817, 102334155, 433494437, 1836311903, 7778742049, 32951280099, 139583862445, 591286729879, 2504730781961, 10610209857723 (list; graph; listen)
OFFSET

0,2

COMMENT

Second binomial transform of (1,1,5,5,25,25,....). - Paul Barry (pbarry(AT)wit.ie), Jul 16 2003

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n) = 4a(n-1)+a(n-2), n>1, a(0)=1, a(1)=3; G.f.: (1-x)/(1-4*x-x^2); a(n)=[ (1+sqrt(5))(2+sqrt(5))^n - (1-sqrt(5))(2-sqrt(5))^n ]/2*sqrt(5).

a(n)=sum{k=0..n, sum{j=0..n-k, C(n,j)C(n-j,k)F(n-j+1)}}; - Paul Barry (pbarry(AT)wit.ie), May 19 2006

MAPLE

with(combinat): a:=n->fibonacci(n, 4)-fibonacci(n-1, 4): seq(a(n), n=1..22); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 04 2008

CROSSREFS

A033887(n)=A001076(n)+A001077(n).

Equals 2*A049651(n) + 1.

Sequence in context: A140320 A037583 A093834 this_sequence A117376 A102287 A006225

Adjacent sequences: A033884 A033885 A033886 this_sequence A033888 A033889 A033890

KEYWORD

nonn,easy

AUTHOR

njas

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 July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research