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 A246558 #37 Feb 11 2025 11:50:53 %S A246558 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 A246558 3456,0,162,1728,168,720,0,7776,0,33600,0,30240,0,15680,0,311040,0,0, %U A246558 326592,435456,0,0,0,0,0,0,0,0,0,102060,3951360,24883200,1411200 %N A246558 Product of the digits of the n-th Fibonacci number. %C A246558 a(n) > 0 iff n in A076564. %C A246558 Probably, the last nonzero term is a(184). - _Giovanni Resta_, Jul 14 2015 %H A246558 Alois P. Heinz, <a href="/A246558/b246558.txt">Table of n, a(n) for n = 0..1000</a> %F A246558 a(n) = A007954(A000045(n)). - _Reinhard Zumkeller_, Nov 17 2014 %e A246558 Fibonacci(7) = 13, thus a(7) = 1*3 = 3. %t A246558 Array[Times@@IntegerDigits@Fibonacci[#]&, 100, 0] (* _Vincenzo Librandi_, Jan 04 2020 *) %o A246558 (Haskell) %o A246558 a246558 = a007954 . a000045 -- _Reinhard Zumkeller_, Nov 17 2014 %o A246558 (Magma) %o A246558 [0] cat [&*Intseq(Fibonacci(n)): n in [1..100]]; // _Vincenzo Librandi_, Jan 04 2020 %o A246558 (PARI) a(n) = if (n, vecprod(digits(fibonacci(n))), 0); \\ _Michel Marcus_, Feb 11 2025 %Y A246558 Cf. A000045, A004090, A076564. %Y A246558 Cf. A007954, A259773. %Y A246558 Cf. A261598. %K A246558 nonn,base,easy,less %O A246558 0,4 %A A246558 _Indrani Das_, Nov 12 2014