File:Binary and generalized Fibonacci numbers - no composition addend divisible by 2 (Fibonacci numbers).svg
Jump to navigation
Jump to search
Size of this PNG preview of this SVG file: 259 × 11 pixels. Other resolutions: 320 × 14 pixels | 640 × 27 pixels | 1,024 × 43 pixels | 1,280 × 54 pixels | 2,560 × 109 pixels.
Original file (SVG file, nominally 259 × 11 pixels, file size: 294 KB)
|
This is a file from the Wikimedia Commons. The description on its description page there is shown below.
Commons is a freely licensed media file repository. You can help. |
.svg){kind=small}
.svg)
| Description |
Quote from F(n) = number of compositions of n into odd parts; e.g. F(6) counts 1+1+1+1+1+1, 1+1+1+3, 1+1+3+1, 1+3+1+1, 1+5, 3+1+1+1, 3+3, 5+1. Due to the bijection between compositions Odd composition addends:
These blocks, corresponding to odd composition addends, are marked in strong red. Columns without even composition addents (i.e. without light red squares) are marked by a black dot. Counting these black dots from left side to a green trigon gives a Fibonacci number. |
||
| Source | Own work | ||
| Author |
|
||
| Permission (Reusing this file) |
|
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 16:47, 8 September 2010 | | 259 × 11 (294 KB) | Watchduck | {{Information |Description=Quote from OEIS [http://www.research.att.com/njas/sequences/A000045 A000045]: F(n) = number of compositions of n into odd parts; e.g. F(6) counts 1+1+1+1+1+1, 1+1+1+3, 1+1+3+1, |
File usage
The following page uses this file:
.svg){kind=link}