This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A046815 #9 Jan 05 2025 19:51:35 %S A046815 1,3,8,21,24,144,58,63,147,155,152,173,168,385,398,461,406,401,435, %T A046815 1215,440,1016,1011,1063,1053,1045,1066,2608,1050,1139,1160,2650,2642, %U A046815 1155,2663,2807,2647,6841,2969,2749,2736,7145,2757,2791 %N A046815 Smallest number which can be written as the sum of distinct Fibonacci numbers in n ways and such that the Zeckendorf representation of the number uses only even-subscripted Fibonacci numbers. %C A046815 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. %H A046815 Marjorie Bicknell-Johnson, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/40-3/bicknell.pdf">The least integer having p Fibonacci representations (p prime)</a>, Fibonacci Quarterly 40 (2002), pp. 260-265. %e A046815 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. %Y A046815 Cf. A002487, A013583. %K A046815 nonn %O A046815 1,2 %A A046815 Marjorie Bicknell-Johnson (marjohnson(AT)earthlink.net)