login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A273046
Fibonacci numbers with digits in nonincreasing order.
2
0, 1, 1, 2, 3, 5, 8, 21, 55, 610, 987
OFFSET
1,4
COMMENTS
Presumably there are no more terms in this sequence. - Charles R Greathouse IV, May 17 2016
MATHEMATICA
Select[Fibonacci@ Range[0, 10^4], Reverse@ Sort@ # == # &@ IntegerDigits@ # &] (* Michael De Vlieger, May 13 2016 *)
PROG
(PARI) fibmod(n, m)=lift(((Mod([1, 1; 1, 0], m))^n)[1, 2])
isA009996(n)=my(d=digits(n)); vecsort(d, , 4)==d
B1=10^9; B2=10^57;
for(n=1, 1e9, if(isA009996(fibmod(n, B1)) && isA009996(fibmod(n, B2)) && isA009996(F=fibonacci(n)), print1(F", "))) \\ Charles R Greathouse IV, May 17 2016
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Omar E. Pol, May 13 2016
STATUS
approved