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,4

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

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 *)

Prog

(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

Crossrefs

Cf. A000045, A004091.

Cf. A214855, A004086.

Sequence in context: A084624 A238548 A356235 * A247116 A028955 A246321

Adjacent sequences: A004167 A004168 A004169 * A004171 A004172 A004173

Keyword

nonn,base,easy,nice

Author

N. J. A. Sloane

Status

approved