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 A152599 #20 Jan 22 2024 05:53:34
%S A152599 1,4,28,232,1984,17056,146752,1262848,10867456,93520384,804794368,
%T A152599 6925699072,59599458304,512886194176,4413668442112,37982050091008,
%U A152599 326856479604736,2812780194955264,24205524194295808,208301879603494912,1792552505703399424,15425902501792055296
%N A152599 a(n) = 10*a(n-1) - 12*a(n-2) for n > 1; a(0) = 1, a(1) = 4 .
%H A152599 Paolo Xausa, <a href="/A152599/b152599.txt">Table of n, a(n) for n = 0..1000</a>
%H A152599 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (10,-12).
%F A152599 G.f.: (1-6*x)/(1-10*x+12*x^2).
%F A152599 a(n) = Sum_{k=0..n} A147703(n,k)*3^(n-k).
%F A152599 a(n) = 2^n*A052961(n). - _R. J. Mathar_, Jun 14 2016
%t A152599 LinearRecurrence[{10, -12}, {1, 4}, 25] (* _Paolo Xausa_, Jan 19 2024 *)
%Y A152599 Cf. A052961, A006012, A147703, A152596.
%K A152599 nonn,easy
%O A152599 0,2
%A A152599 _Philippe Deléham_, Dec 09 2008