Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #29 Jun 29 2019 02:19:41
%S 20,212,2351,15127,178707,1981891,21979508,141422324,1670731762,
%T 18528699171,205486422643,2278879348244,14662949395604,
%U 173224810531570,1921092587268915,21305243270489635,236278768562654900
%N a(n) is the sum of all n-digit Fibonacci numbers.
%C The minimum, average and maximum of a(n)/10^n are approximately equal to 1.38197968245, 1.87028385088 & 2.38195747810, respectively, for the first 30000 terms.
%C Observation: the minimum seems to be just over (5-sqrt(5))/2, the maximum seems to be just shy of (7-sqrt(5))/2; the average is not (6-sqrt(5))/2 but seems to be closer to (5-sqrt(11))/9. - _Robert G. Wilson v_, May 26 2007
%C Observation: There are approximately twice as many odd terms as even ones.
%H Robert G. Wilson v, <a href="/A128823/b128823.txt">Table of n, a(n) for n = 1..100</a>
%H C. Valente, PlanetMath.org, <a href="http://planetmath.org/listoffibonaccinumbers">List of Fibonacci Numbers</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Fibonacci_number">Fibonacci Numbers</a>.
%F a(n) = A000045(A072354(n+1)+1) - A000045(A072354(n)+1). - _Christopher Hohl_, May 27 2019
%e If n=1 then the sum of the Fibonacci numbers 1+1+2+3+5+8 = 20 which is the first term in the sequence.
%e If n=2 then the sum of the Fibonacci numbers 13+21+34+55+89 = 212 which is the second term in the sequence.
%t f[n_] := Plus @@ Select[ Fibonacci /@ Range[ Floor[(n - 1)*Log[ GoldenRatio, 10] + 1], Floor[ n*Log[ GoldenRatio, 10] + 3]], Floor@ Log[10, # ] + 1 == n &]; Array[f, 18] (* _Robert G. Wilson v_, May 26 2007 *)
%Y Cf. A000045, A072354.
%K nonn,base
%O 1,1
%A _Parthasarathy Nambi_, Apr 11 2007
%E More terms from _Robert G. Wilson v_, May 26 2007