login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 22:57 EDT 2024. Contains 376090 sequences. (Running on oeis4.)