OFFSET
1,2
COMMENTS
Each term is >= corresponding term of A013583, smallest number that can be written as sum of distinct Fibonacci numbers in n ways. Equality holds for n prime, n a Fibonacci number, n a Lucas number as well as some other cases.
LINKS
Marjorie Bicknell-Johnson, The least integer having p Fibonacci representations (p prime), Fibonacci Quarterly 40 (2002), pp. 260-265.
EXAMPLE
a(9)=147 because 147=F(12)+F(4) and 147 is the smallest such integer having 9 representations: 147=144+3 or 144+2+1 or 89+55+3 or 89+55+2+1 or 89+34+21+3 or 89+34+21+2+1 or 89+34+13+8+3 or 89+34+13+8+2+1 or 89+34+13+5+3+2+1.
CROSSREFS
KEYWORD
nonn
AUTHOR
Marjorie Bicknell-Johnson (marjohnson(AT)earthlink.net)
STATUS
approved