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 A322783 #25 Mar 19 2019 00:37:33 %S A322783 2,3,4,9,18,39,80,165,334,675,1356,2721,5450,10911,21832,43677,87366, %T A322783 174747,349508,699033,1398082,2796183,5592384,11184789,22369598, %U A322783 44739219,89478460,178956945,357913914,715827855,1431655736 %N A322783 a(n) = 1 - n + (2^(n+2) - (-1)^n)/3. %C A322783 a(n) mod 10 = period 20: repeat [2, 3, 4, 9, 8, 9, 0, 5, 4, 5, 6, 1, 0, 1, 2, 7, 6, 7, 8, 3] = disordered [0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9]. %H A322783 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (3,-1,-3,2). %F A322783 a(n+1) - 2*(n) = -1, -2, 1, 0, 3, 2, 5, 4, ..., n >= 0. %F A322783 a(n+1) - a(n) = A097074(n). %F A322783 a(n+2) - 2*a(n+1) + a(n) = A097073(n+1). %F A322783 From _Colin Barker_, Dec 26 2018: (Start) %F A322783 G.f.: (2 - 3*x - 3*x^2 + 6*x^3) / ((1 - x)^2*(1 + x)*(1 - 2*x)). %F A322783 a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + 2*a(n-4) for n > 3. %F A322783 (End) %o A322783 (PARI) Vec((2 - 3*x - 3*x^2 + 6*x^3) / ((1 - x)^2*(1 + x)*(1 - 2*x)) + O(x^40)) \\ _Colin Barker_, Dec 26 2018 %Y A322783 Cf. A001045, A004442(n-2), A097073, A097074. %K A322783 nonn,easy %O A322783 0,1 %A A322783 _Paul Curtz_, Dec 26 2018