cp's OEIS Frontend

A004170 Reversals of Fibonacci numbers (sorted).

%I A004170 #23 Dec 04 2024 10:35:49
%S A004170 0,1,1,2,3,5,8,12,16,31,43,55,98,332,441,773,789,1814,4852,5676,7951,
%T A004170 11771,40238,52057,64901,75682,86364,118713,393121,814691,922415,
%U A004170 5647229,7882075,8754253,9038712,9626431
%N A004170 Reversals of Fibonacci numbers (sorted).
%C A004170 The smallest Fibonacci number with 1, 2, 3,... trailing zeros is F(15), F(150), F(750), F(7500), F(75000),.... This provides an idea of how many digits may be "lost" by reversal. - _R. J. Mathar_, Mar 11 2013
%H A004170 Reinhard Zumkeller, <a href="/A004170/b004170.txt">Table of n, a(n) for n = 0..1000</a>
%H A004170 Juan F. Pulido, José L. Ramírez, and Andrés R. Vindas-Meléndez, <a href="https://arxiv.org/abs/2411.17812">Generating Trees and Fibonacci Polyominoes</a>, arXiv:2411.17812 [math.CO], 2024. See p. 8.
%t A004170 Sort[FromDigits[Reverse[IntegerDigits[#]]]&/@Fibonacci[Range[0,40]]] (* _Harvey P. Dale_, Jun 17 2011 *)
%t A004170 IntegerReverse[Fibonacci[Range[0,40]]]//Sort (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Jun 02 2019 *)
%o A004170 (Haskell)
%o A004170 import Data.Set (fromList, deleteFindMin, insert)
%o A004170 a004170 n = a004170_list !! n
%o A004170 a004170_list = 0 : 1 : f (fromList us) vs where
%o A004170    f s (x:xs) = m : f (insert x s') xs
%o A004170      where (m,s') = deleteFindMin s
%o A004170    (us,vs) = splitAt 120 $ drop 2 a004091_list
%o A004170 -- _Reinhard Zumkeller_, Mar 09 2013
%Y A004170 Cf. A000045, A004091.
%Y A004170 Cf. A214855, A004086.
%K A004170 nonn,base,easy,nice
%O A004170 0,4
%A A004170 _N. J. A. Sloane_