A004170 Reversals of Fibonacci numbers (sorted).

0, 1, 1, 2, 3, 5, 8, 12, 16, 31, 43, 55, 98, 332, 441, 773, 789, 1814, 4852, 5676, 7951, 11771, 40238, 52057, 64901, 75682, 86364, 118713, 393121, 814691, 922415, 5647229, 7882075, 8754253, 9038712, 9626431

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn
• base
• easy
• nice

Comments

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

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..1000
• Juan F. Pulido, José L. Ramírez, and Andrés R. Vindas-Meléndez, Generating Trees and Fibonacci Polyominoes, arXiv:2411.17812 [math.CO], 2024. See p. 8.

Crossrefs

Cf. A000045, A004091.

Cf. A214855, A004086.

Programs

Haskell

import Data.Set (fromList, deleteFindMin, insert)
a004170 n = a004170_list !! n
a004170_list = 0 : 1 : f (fromList us) vs where
   f s (x:xs) = m : f (insert x s') xs
     where (m,s') = deleteFindMin s
   (us,vs) = splitAt 120 $ drop 2 a004091_list
-- Reinhard Zumkeller, Mar 09 2013

Mathematica

Sort[FromDigits[Reverse[IntegerDigits[#]]]&/@Fibonacci[Range[0,40]]] (* Harvey P. Dale, Jun 17 2011 *)
IntegerReverse[Fibonacci[Range[0,40]]]//Sort (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jun 02 2019 *)