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.
%I A267551 #16 Jul 18 2023 02:10:05 %S A267551 2,1,3,4,7,11,81,92,74,67,321,991,223,125,348,4631,7022,1753,8775, %T A267551 9439,72151,67442,30693,97046,286301,167761,344172,402934,746017, %U A267551 1589411,8940681,9430103,7480784,6911887,34025721,93233602,28258333,12581045,30830478 %N A267551 Lucas numbers written backwards. %H A267551 Seiichi Manyama, <a href="/A267551/b267551.txt">Table of n, a(n) for n = 0..1000</a> %F A267551 a(n) = A004086(A000032(n)). %e A267551 81 is in the sequence because 7 + 11 = 18, which is 81 written backwards. %t A267551 FromDigits[Reverse[IntegerDigits[#]]]&/@LucasL[Range[0, 50]] %o A267551 (Magma) [Seqint(Reverse(Intseq(Lucas(n)))): n in [0..50]]; %o A267551 (PARI) a(n) = eval(concat(Vecrev(Str(fibonacci(n+1)+fibonacci(n-1))))); \\ _Altug Alkan_, Jan 17 2016 %Y A267551 Cf. A000032, A004086, A004091, A140463. %K A267551 nonn,base,easy %O A267551 0,1 %A A267551 _Vincenzo Librandi_, Jan 17 2016