Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093042
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093042 Jacobsthal(n)*Fibonacci(n). +0
3
0, 1, 1, 6, 15, 55, 168, 559, 1785, 5814, 18755, 60787, 196560, 636323, 2058797, 6663030, 21561015, 69774527, 225792504, 730684103, 2364536625, 7651812246, 24761766811, 80130789371, 259308635040, 839140445275, 2715515402053 (list; graph; listen)
OFFSET

0,4

COMMENT

Form a graph from a triangle and its midpoint triangle. A093042 counts walks of length n between a vertex of the original triangle and an adjacent vertex of the midpoint triangle.

FORMULA

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

CROSSREFS

Sequence in context: A122365 A119132 A073065 this_sequence A067665 A012595 A012294

Adjacent sequences: A093039 A093040 A093041 this_sequence A093043 A093044 A093045

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research