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 A164955 #23 Jul 09 2023 13:20:04 %S A164955 1,1,1,2,6,120,40320,7,3,30,240,403200,49,14,10086,722,408240,368041, %T A164955 40466,40346,6600,363626,10083,46202,41790,5283,362896,403946,45369, %U A164955 363029,40354,364353,408250,45632,90843,368788,363040,50548,807128,404792,281,41308 %N A164955 Sequence obtained from Fibonacci numbers by taking the factorials of each digit and summing. %C A164955 There seem to be very few primes in this sequence. %H A164955 Alois P. Heinz, <a href="/A164955/b164955.txt">Table of n, a(n) for n = 0..10000</a> %H A164955 Dario Alpern, <a href="https://www.alpertron.com.ar/ECM.HTM">Factorization using the Elliptic Curve Method</a> %F A164955 a(n) = A061602(A000045(n)). - _Alois P. Heinz_, Jul 09 2023 %e A164955 a(30) = 8!+3!+2!+0!+4!+0! = 40354 because Fibonacci(30) = 832040. %p A164955 a:= n-> add(i!, i=convert((<<0|1>, <1|1>>^n)[1,2], base, 10)): %p A164955 seq(a(n), n=0..42); # _Alois P. Heinz_, Jul 09 2023 %t A164955 Total[IntegerDigits[#]!]&/@Fibonacci[Range[0,40]] (* _Harvey P. Dale_, May 03 2011 *) %Y A164955 Cf. A000045, A000142, A004090, A061602. %K A164955 nonn,look,base %O A164955 0,4 %A A164955 _Parthasarathy Nambi_, Sep 01 2009 %E A164955 Offset corrected and more terms from _Alois P. Heinz_, Jul 09 2023