This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A119457 Triangle read by rows: T(n,1)=n, T(n,2)=(n-1)*2 for n>1 and T(n,k)=T(n-1,k-1)+T(n-2,k-2) for 2
 1, 2, 2, 3, 4, 3, 4, 6, 6, 5, 5, 8, 9, 10, 8, 6, 10, 12, 15, 16, 13, 7, 12, 15, 20, 24, 26, 21, 8, 14, 18, 25, 32, 39, 42, 34, 9, 16, 21, 30, 40, 52, 63, 68, 55, 10, 18, 24, 35, 48, 65, 84, 102, 110, 89, 11, 20, 27, 40, 56, 78, 105, 136, 165, 178, 144, 12, 22, 30, 45, 64, 91, 126 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Row sums give A001891; central terms give A023607; T(n,1) = n; T(n,2) = A005843(n-1) for n>1; T(n,3) = A008585(n-2) for n>2; T(n,4) = A008587(n-3) for n>3; T(n,5) = A008590(n-4) for n>4; T(n,6) = A008595(n-5) for n>5; T(n,7) = A008603(n-6) for n>6; T(n,n-6) = A022090(n-5) for n>6; T(n,n-5) = A022089(n-4) for n>5; T(n,n-4) = A022088(n-3) for n>4; T(n,n-3) = A022087(n-2) for n>3; T(n,n-2) = A022086(n-1) for n>2; T(n,n-1) = A006355(n+1) for n>1; T(n,n) = A000045(n+1); LINKS Eric Weisstein's World of Mathematics, Fibonacci Number FORMULA T(n,n) = (n+1)-th Fibonacci number, T(n,k) = (n-k+1)*T(k,k) for 1<=k

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 22 14:26 EDT 2019. Contains 322349 sequences. (Running on oeis4.)