The least number having 331 representations as a sum of distinct Fibonacci numbers (Q2765407)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The least number having 331 representations as a sum of distinct Fibonacci numbers |
scientific article; zbMATH DE number 1694704
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The least number having 331 representations as a sum of distinct Fibonacci numbers |
scientific article; zbMATH DE number 1694704 |
Statements
4 June 2003
0 references
representations by Fibonacci numbers
0 references
The least number having 331 representations as a sum of distinct Fibonacci numbers (English)
0 references
Let \(A_n\) be the least number having exactly \(n\) representations as a sum of distinct Fibonacci numbers. \(A_n\) is given for still missing values for \(n\) with \(331\leq n\leq 465\) including information about the methods of calculation.
0 references
