This site is supported by donations to The OEIS Foundation.

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A208245 Triangle read by rows: a(n,k) = a(n-2,k) + a(n-2,k-1). 2
 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 3, 3, 2, 1, 1, 1, 3, 4, 3, 2, 1, 1, 1, 4, 6, 5, 3, 2, 1, 1, 1, 4, 7, 7, 5, 3, 2, 1, 1, 1, 5, 10, 11, 8, 5, 3, 2, 1, 1, 1, 5, 11, 14, 12, 8, 5, 3, 2, 1, 1, 1, 6, 15, 21, 19, 13, 8, 5, 3, 2, 1, 1, 1, 6, 16, 25, 26, 20, 13, 8, 5, 3, 2, 1, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 COMMENTS Sum of terms in each row are given by sequence A052955. Columns (at constant k) converge toward Fibonacci starting first from high value of k). First seven rows are same as A008242. The odd numbered rows of this sequence equal the rows of A123736.  Also it has some similarities to A162741. Columns (constant k), prior to convergence to Fibonacci, appear as various other sequences (e.g. k = 4, is sequence A055803, with other columns in same referenced family). LINKS Reinhard Zumkeller, Rows n = 1..100 of triangle, flattened FORMULA a(n,k) = a(n-2,k) + a(n-2,k-1); if n=k or k=1 then a(n,k)=1; if n

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