A272918 Fibonacci numbers with the base 10 digits sorted into increasing order.

0, 1, 1, 2, 3, 5, 8, 13, 12, 34, 55, 89, 144, 233, 377, 16, 789, 1579, 2458, 1148, 5667, 1469, 11177, 25678, 34668, 2557, 112339, 114689, 111378, 122459, 2348, 1234669, 123789, 2345578, 257788, 2245679, 1233459, 11245778, 1368899, 23456689, 11233455, 11145568

Offset

0,4

Comments

Leading zeros are omitted, of course.

Links

G. C. Greubel, Table of n, a(n) for n = 0..500

Formula

a(n) = A004185(A000045(n)). - Michel Marcus, May 17 2016

Example

a(8) = 12 because F(8) = 21, so the digits in ascending order become 12.
a(9) = 34 = F(9), the digits are already in ascending order.

Mathematica

Table[FromDigits[Sort[IntegerDigits[Fibonacci[n]]]], {n, 0, 49}]

Prog

(Python)
from gmpy2 import fib
for n in range(500):
   print(''.join(sorted(list(str(fib(n))))), end=', ')
# Soumil Mandal, May 14 2016

Crossrefs

Cf. A000045, A004185.

Sequence in context: A065076 A069638 A237568 * A010076 A182444 A138183

Adjacent sequences: A272915 A272916 A272917 * A272919 A272920 A272921

Keyword

nonn,base,easy

Author

Alonso del Arte, May 10 2016

Status

approved