|
%I #5 Sep 05 2015 12:59:46
%S 0,0,0,0,0,0,2,2,1,2,1,1,3,1,1,1,2,3,3,1,1,3,3,2,3,7,3,5,4,3,5,5,5,4,
%T 3,5,5,4,4,10,7,3,4,4,7,7,7,3,2,7,5,6,8,6,9,9,7,7,5,8,6,8,7,8,6,8,10,
%U 8,3,7,10,6,10,8,9,6,8,7,12,11,9,11,7,8,11,7,11,10,6,9,8,9,13,11,7,13,14,11
%N Number of embedded Fibonacci numbers within the n-th Fibonacci number.
%H Gil Broussard, <a href="http://home.mindspring.com/~kikiriki/id0.html">The Embedded Fibonacci Sequence</a>.
%e a(26)=7 because Fib(26)=121393 and 7 Fibonacci numbers appear within 121393: 1 appears twice, 3 appears twice and 2, 13 and 21 each appear once.
%t Table[Total[Table[SequenceCount[IntegerDigits[Fibonacci[n]], IntegerDigits[ Fibonacci[ i]]],{i,2,n-1}]],{n,100}] (* The program uses the SequenceCount function from Mathematica version 10 *) (* _Harvey P. Dale_, Sep 05 2015 *)
%Y Cf. A000045.
%K nonn,base
%O 1,7
%A _Gil Broussard_, Jan 12 2004
|
