Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058071
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058071 A Fibonacci triangle: triangle T(n,k) in which n-th row consists of the numbers F(k)F(n+2-k), where F() are the Fibonacci numbers, for n >= 0, 0<=k<=n+2. +0
6
1, 1, 1, 2, 1, 2, 3, 2, 2, 3, 5, 3, 4, 3, 5, 8, 5, 6, 6, 5, 8, 13, 8, 10, 9, 10, 8, 13, 21, 13, 16, 15, 15, 16, 13, 21, 34, 21, 26, 24, 25, 24, 26, 21, 34, 55, 34, 42, 39, 40, 40, 39, 42, 34, 55, 89, 55, 68, 63, 65, 64, 65, 63, 68, 55, 89, 144, 89, 110, 102, 105, 104, 104, 105 (list; table; graph; listen)
OFFSET

0,4

COMMENT

Row sums are A001629 (Fibonacci numbers convolved with themselves.). The main diagonal and first subdiagonal are Fibonacci numbers, for other entries T(n,k) = T(n-1,k) + T(n-2,k). The central numbers form A006498. - Gerald McGarvey (gerald.mcgarvey(AT)comcast.net), Jun 02 2005

Row n = edge-counting vector for the Fibonacci cube F(n+1) embedded in the natural way in the hypercube Q(n+1). - Emanuele Munarini (emanuele.munarini(AT)polimi.it), Apr 01 2008

REFERENCES

B. A. Bondarenko, Generalized Pascal Triangles and Pyramids (in Russian), FAN, Tashkent, 1990, ISBN 5-648-00738-8. English translation published by Fibonacci Association, Santa Clara Univ., Santa Clara, CA, 1993; see p. 27.

H. Hosoya, "Fibonacci Triangle", The Fibonacci Quarterly, 14;2, 1976, 173-178.

Thomas Koshy, "Fibonacci and Lucas Numbers and Applications", Chap. 15, Hosoya's Triangle, Wiley, New York, 2001.

T. V. Trif, Solution to Problem 10706 proposed by J. G. Propp, Amer. Math. Monthly, 107 (Nov. 2000), p. 866-867.

S. Klavzar, I. Peterin Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle, Publ. Math. Debrecen 71/3-4 (2007), 267-278.

LINKS

Emanuele Munarini (emanuele.munarini(AT)polimi.it), Apr 01 2008, Table of n, a(n) for n = 0..860

FORMULA

G.f.: T(x,y) = 1/((1-x-x^2)(1-xy-x^2y^2)). Recurrence: T(n+4,k+2) = T(n+3,k+2) + T(n+3,k+1) + T(n+2,k+2) - T(n+2,k+1) + T(n+2,k) - T(n+1,k+1) - T(n+1,k) - T(n,k) - Emanuele Munarini (emanuele.munarini(AT)polimi.it), Apr 01 2008

EXAMPLE

1; 1,1; 2,1,2; 3,2,2,3; 5,3,4,3,5; ...

CROSSREFS

Adjacent sequences: A058068 A058069 A058070 this_sequence A058072 A058073 A058074

Sequence in context: A087061 A082860 A098357 this_sequence A094572 A104889 A117910

KEYWORD

nonn,easy,tabl

AUTHOR

njas, Nov 24 2000

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Nov 27 2000

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 11 10:28 EDT 2008. Contains 139662 sequences.


AT&T Labs Research