cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A273046 Fibonacci numbers with digits in nonincreasing order.

Original entry on oeis.org

0, 1, 1, 2, 3, 5, 8, 21, 55, 610, 987
Offset: 1

Views

Author

Omar E. Pol, May 13 2016

Keywords

Comments

Presumably there are no more terms in this sequence. - Charles R Greathouse IV, May 17 2016

Crossrefs

Programs

  • Mathematica
    Select[Fibonacci@ Range[0, 10^4], Reverse@ Sort@ # == # &@ IntegerDigits@ # &] (* Michael De Vlieger, May 13 2016 *)
  • 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