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 A348845 #7 Jan 18 2022 06:18:31
%S A348845 11,35,59,83,107,131,155,179,203,227,251,275,299,323,347,371,395,419,
%T A348845 443,467,491,515,539,563,587,611,635,659,683,707,731,755,779,803,827,
%U A348845 851,875,899,923,947,971,995,1019,1043,1067
%N A348845 Part two of the trisection of A017101: a(n) = 11 + 24*n.
%C A348845 The trisection of A017101 = {3 + 8*k}_{k>=0} gives 3*A017077 = {3*(1 + 12*n)}_{n>=0}, {a(n)}_{n >= 0} and A350051 = {19 + 24*n}_{n>=0}. These three sequences are congruent to 3 modulo 8 and to 3, 5, and 1 modulo 6, respectively.
%H A348845 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A348845 a(n) = 11 + 24*n = 11 + A008606(n), for n >= 0
%F A348845 a(n) = 2*a(n-1) - a(n-2), for n >= 1, with a(-1) = -13, a(0) = 11.
%F A348845 G.f.: (11 + 13*x)/(1-x)^2.
%F A348845 E.g.f.: (11 + 24*x)*exp(x).
%t A348845 24 * Range[0, 44] + 11 (* _Amiram Eldar_, Dec 18 2021 *)
%Y A348845 Cf. A008606, 3*A017077, A017101, A350051.
%K A348845 nonn,easy
%O A348845 0,1
%A A348845 _Wolfdieter Lang_, Dec 11 2021