Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093043
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093043 Jacobsthal(n)*Fibonacci(n-1). +0
1
0, 0, 1, 3, 10, 33, 105, 344, 1105, 3591, 11594, 37565, 121485, 393264, 1272413, 4117971, 13325450, 43123017, 139547457, 451587592, 1461364025, 4729080015, 15303613546, 49523551333, 160261550085, 518617316448, 1678280815525 (list; graph; listen)
OFFSET

0,4

COMMENT

Form a graph from a triangle and its midpoint triangle. A093043 counts walks of length n between two vertices of the original triangle.

FORMULA

G.f.: x^2(1+2x)/((1+x-x^2)(1-2x-4x^2)); a(n)=A001045(n)*A000045(n-1); a(n) := (2^n/3-(-1)^n/3)(((1+sqrt(5))/2)^(n-1)/sqrt(5)-((1-sqrt(5))/2)^(n-1)/sqrt(5)).

CROSSREFS

Sequence in context: A115240 A027989 A096483 this_sequence A061566 A082398 A053156

Adjacent sequences: A093040 A093041 A093042 this_sequence A093044 A093045 A093046

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Mar 22 2004

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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research