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 A350923 #19 May 30 2025 10:10:22
%S A350923 2,2,14,134,1322,13082,129494,1281854,12689042,125608562,1243396574,
%T A350923 12308357174,121840175162,1206093394442,11939093769254,
%U A350923 118184844298094,1169909349211682,11580908647818722,114639177128975534,1134810862641936614,11233469449290390602,111199883630261969402
%N A350923 a(0) = 2, a(1) = 2, and a(n) = 10*a(n-1) - a(n-2) - 4 for n >= 2.
%C A350923 One of 10 linear second-order recurrence sequences satisfying (a(n)*a(n-1)-1) * (a(n)*a(n+1)-1) = (a(n)+1)^4 and together forming A350916.
%C A350923 Essentially the same as A157085. - _R. J. Mathar_, Feb 07 2022
%H A350923 Paolo Xausa, <a href="/A350923/b350923.txt">Table of n, a(n) for n = 0..1000</a>
%H A350923 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (11,-11,1).
%F A350923 G.f.: 2*(1 - 10*x + 7*x^2)/((1 - x)*(1 - 10*x + x^2)). - _Stefano Spezia_, Jan 22 2022
%F A350923 From _Hugo Pfoertner_, Jan 22 2022: (Start)
%F A350923 a(n) = A031138(n) + 1.
%F A350923 a(n) = 3*A054318(n) - 1.
%F A350923 a(n) = 12*A097784(n-2) + 2 for n >= 2. (End)
%F A350923 a(n) = 2 * A253175(n) for n>=1. - _Alois P. Heinz_, Jan 22 2022
%t A350923 LinearRecurrence[{11, -11, 1}, {2, 2, 14}, 25] (* _Paolo Xausa_, May 30 2025 *)
%Y A350923 Cf. A031138, A054318, A097784, A253175, A350916.
%Y A350923 Other sequences satisfying (a(n)*a(n-1)-1) * (a(n)*a(n+1)-1) = (a(n)+1)^4: A103974, A350917, A350919, A350920, A350921, A350922, A350924, A350925, A350926.
%K A350923 nonn,easy
%O A350923 0,1
%A A350923 _Max Alekseyev_, Jan 22 2022