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 A307799 #6 Apr 29 2019 20:37:17 %S A307799 0,3,9,84,4041,5673648,48020423368761,806086788756824484462571572, %T A307799 221815145293562950532110825781341443907408910699844537 %N A307799 a(0) = 0, a(1) = 3; a(n) = rev(a(n-1))*a(n-1) + a(n-2), where rev = digit reversal (A004086). %C A307799 The next term is too large to include. %e A307799 +---+--------------+---------------------+------------------+ %e A307799 | n | a(n)/a(n+1) | Continued fraction | Comment | %e A307799 +---+--------------+---------------------+------------------+ %e A307799 | 1 | 3/9 | [0; 3] | 3 = rev(a(1)) | %e A307799 +---+--------------+---------------------+------------------+ %e A307799 | 2 | 9/84 | [0; 9, 3] | 9 = rev(a(2)) | %e A307799 +---+--------------+---------------------+------------------+ %e A307799 | 3 | 84/4041 | [0; 48, 9, 3] | 48 = rev(a(3)) | %e A307799 +---+--------------+---------------------+------------------+ %e A307799 | 4 | 4041/5673648 | [0; 1404, 48, 9, 3] | 1404 = rev(a(4)) | %e A307799 +---+--------------+---------------------+------------------+ %t A307799 a[n_] := a[n] = FromDigits[Reverse[IntegerDigits[a[n - 1]]]] a[n - 1] + a[n - 2]; a[0] = 0; a[1] = 3; Table[a[n], {n, 0, 8}] %Y A307799 Cf. A001040, A004086, A058182. %K A307799 nonn,base %O A307799 0,2 %A A307799 _Ilya Gutkovskiy_, Apr 29 2019