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 A146529 #5 Mar 16 2025 09:29:47
%S A146529 6,8,12,18,30,54,102,198,390,774,1542,3078,6150,12294,24582,49158,
%T A146529 98310,196614,393222,786438,1572870,3145734,6291462,12582918,25165830,
%U A146529 50331654,100663302,201326598,402653190,805306374,1610612742
%N A146529 A two level sequence: v(n)=2*(If[n == 0, 0, 2^(n - 1)] + 2); a(n)=If[n == 0, 6, (v[n] + v[n - 1] - 2)].
%H A146529 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2).
%F A146529 v(n)=2*(If[n == 0, 0, 2^(n - 1)] + 2); a(n)=If[n == 0, 6, (v[n] + v[n - 1] - 2)].
%F A146529 a(n) = 3*a(n-1)-2*a(n-2), n>4. a(n) = 6+3*2^(n-1) = 6+A007283(n-1), n>1. [From _R. J. Mathar_, Nov 21 2008]
%t A146529 v[n_] := 2*(If[n == 0, 0, 2^(n - 1)] + 2); Table[v[n], {n, 0, 30}]; Table[If[n == 0, 6, (v[n] + v[n - 1] - 2)], {n, 0, 30}]
%K A146529 nonn
%O A146529 0,1
%A A146529 _Roger L. Bagula_, Oct 30 2008