[seqfan] Re: What are the possible digit-sums for Fibonacci numbers?

[Hans Havermann]

> a given digitsum is hard even in base 2 -- see https://oeis.org/A222296

Which reminds me, I had completed the base two solutions to A222296 for sums up to one million, except of course I list Fibonacci indices, not the decimal digit expansions. It's a 32 MB file, so give it a minute to load:

http://chesswanks.com/num/FibonacciDigitsSumsBaseTwo.txt