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.

A004091 Fibonacci numbers written backwards.

This page as a plain text file.
%I A004091 #40 Jun 21 2024 12:34:30
%S A004091 0,1,1,2,3,5,8,31,12,43,55,98,441,332,773,16,789,7951,4852,1814,5676,
%T A004091 64901,11771,75682,86364,52057,393121,814691,118713,922415,40238,
%U A004091 9626431,9038712,8754253,7882075,5647229,25303941,71875142,96188093,68954236,551433201,141085561,692419762,734494334,337804107,713094311,3091136381,3705121792
%N A004091 Fibonacci numbers written backwards.
%C A004091 Or, Fibonacci numbers reversed.
%H A004091 N. J. A. Sloane and Alois P. Heinz, <a href="/A004091/b004091.txt">Table of n, a(n) for n = 0..1000</a>
%H A004091 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%H A004091 N. J. A. Sloane, <a href="/A004091/a004091.txt">Maple program for A004091</a>
%F A004091 a(n) = A004086(A000045(n)). - _Reinhard Zumkeller_, Mar 08 2013
%p A004091 a:= n-> (s-> parse(cat(s[-i]$i=1..length(s))))(
%p A004091          ""||((<<0|1>, <1|1>>^n)[1,2])):
%p A004091 seq(a(n), n=0..50);  # _Alois P. Heinz_, Apr 09 2015
%t A004091 FromDigits[Reverse[IntegerDigits[#]]]&/@Fibonacci[Range[50]] (* _Harvey P. Dale_, Jun 10 2011 *)
%t A004091 IntegerReverse[Fibonacci[Range[0,50]]] (* _Harvey P. Dale_, Jun 21 2024 *)
%o A004091 (Haskell)
%o A004091 a004091 = a004086 . a000045  -- _Reinhard Zumkeller_, Mar 08 2013
%o A004091 (Magma) [Seqint(Reverse(Intseq(Fibonacci(n)))): n in [0..50]]; // _Vincenzo Librandi_, Jan 17 2016
%o A004091 (PARI) a(n) = fromdigits(Vecrev(digits(fibonacci(n)))); \\ _Michel Marcus_, Mar 25 2024
%Y A004091 Cf. A000045, A004170, A014258.
%K A004091 nonn,base
%O A004091 0,4
%A A004091 _N. J. A. Sloane_