%I #30 Jan 04 2020 09:02:11
%S 0,1,1,2,3,5,8,3,2,12,25,72,16,18,147,0,504,315,320,32,1260,0,49,3360,
%T 3456,0,162,1728,168,720,0,7776,0,33600,0,30240,0,15680,0,311040,0,0,
%U 326592,435456,0,0,0,0,0,0,0,0,0,102060,3951360,24883200,1411200
%N Product of the digits of the n-th Fibonacci number.
%C a(n) > 0 iff n in A076564.
%C Probably, the last nonzero term is a(184). - _Giovanni Resta_, Jul 14 2015
%H Alois P. Heinz, <a href="/A246558/b246558.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = A007954(A000045(n)). - _Reinhard Zumkeller_, Nov 17 2014
%e Fibonacci(7) = 13, thus a(7) = 1*3 = 3.
%t Array[Times@@IntegerDigits@Fibonacci[#]&, 100, 0] (* _Vincenzo Librandi_, Jan 04 2020 *)
%o (Haskell)
%o a246558 = a007954 . a000045 -- _Reinhard Zumkeller_, Nov 17 2014
%o [0] cat [&*Intseq(Fibonacci(n)): n in [1..100]]; // _Vincenzo Librandi_, Jan 04 2020
%Y Cf. A000045, A004090, A076564.
%Y Cf. A007954, A259773.
%Y Cf. A261598.
%K nonn,base,easy,less
%O 0,4
%A _Indrani Das_, Nov 12 2014