login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A273003 Arrange the base 10 digits of the n-th Fibonacci number in descending order. 0
0, 1, 1, 2, 3, 5, 8, 31, 21, 43, 55, 98, 441, 332, 773, 610, 987, 9751, 8542, 8411, 7665, 96410, 77111, 87652, 86643, 75520, 933211, 986411, 873111, 954221, 843200, 9664321, 9873210, 8755432, 8877520, 9765422, 95433210, 87754211, 99886310, 98665432 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

Conjecture: the largest Fibonacci number F(n) with its base 10 digits already sorted in descending order is F(16) = 987.

LINKS

Table of n, a(n) for n=0..39.

FORMULA

a(n) = A004186(A000045(n)). - Michel Marcus, May 15 2016

EXAMPLE

a(7) = 31 because F(7) = 13, so the digits in descending order become 31.

a(8) = 21 = F(8), the digits are already in descending order.

MATHEMATICA

FromDigits[Reverse[Sort[IntegerDigits[#]]]]&/@Fibonacci[Range[0, 50]] (* Harvey P. Dale, Sep 16 2016 *)

PROG

(PARI) a(n)=fromdigits(vecsort(digits(fibonacci(n)), , 4)) \\ Charles R Greathouse IV, May 15 2016

CROSSREFS

Cf. A000045, A004186, A272918, A273046.

Sequence in context: A290033 A004091 A072210 * A014258 A237575 A275524

Adjacent sequences:  A273000 A273001 A273002 * A273004 A273005 A273006

KEYWORD

nonn,base,easy

AUTHOR

Alonso del Arte, May 12 2016

EXTENSIONS

Corrected and extended by Harvey P. Dale, Sep 16 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 17 02:33 EST 2019. Contains 320200 sequences. (Running on oeis4.)