Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014335
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014335 Exponential convolution of Fibonacci numbers with themselves (divided by 2). +0
2
0, 0, 1, 3, 11, 35, 115, 371, 1203, 3891, 12595, 40755, 131891, 426803, 1381171, 4469555, 14463795, 46805811, 151466803, 490156851, 1586180915, 5132989235, 16610702131, 53753361203, 173949530931 (list; graph; listen)
OFFSET

0,4

FORMULA

G.f.: x^2/(1-2*x-4*x^2)/(1-x). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Mar 05 2003

E.g.f.: exp(x)*(cosh(sqrt(5)*x)-1)/5. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 01 2004

a(n+1)=sum(i=0, n, F(i)*2^(i-1)); a(n)=(1/5)*(2^(n-1)*L(n)-1) where L(n) are Lucas numbers defined in A000032. - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 25 2004

CROSSREFS

Cf. (partial sums of) A063727, A081057, A014334.

Adjacent sequences: A014332 A014333 A014334 this_sequence A014336 A014337 A014338

Sequence in context: A034576 A125672 A107683 this_sequence A119143 A119092 A119177

KEYWORD

nonn

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research