cp's OEIS Frontend

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.

A350051 Part three of the trisection of A017101: a(n) = 19 + 24*n.

This page as a plain text file.
%I A350051 #15 Jan 29 2024 09:02:21
%S A350051 19,43,67,91,115,139,163,187,211,235,259,283,307,331,355,379,403,427,
%T A350051 451,475,499,523,547,571,595,619,643,667,691,715,739,763,787,811,835,
%U A350051 859,883,907,931,955,979,1003,1027,1051,1075
%N A350051 Part three of the trisection of A017101: a(n) = 19 + 24*n.
%C A350051 The trisection of A017101 = {3 + 8*k}_{k>=0} gives 3*A017077 = {3*(1 + 12*n)}_{n>=0}, {A348845(n)}_{n >= 0} and  {a(n)}_{n>=0}. These three sequences are congruent to 3 modulo 8 and to 3, 5, and 1 modulo 6, respectively.
%H A350051 Winston de Greef, <a href="/A350051/b350051.txt">Table of n, a(n) for n = 0..10000</a>
%H A350051 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A350051 a(n) = 19 + 24*n = 19 + A008606(n), for n >= 0
%F A350051 a(n) = 2*a(n-1) - a(n-2), for n >= 1, with a(-1) = -5, a(0) = 19.
%F A350051 G.f.: (19 + 5*x)/(1-x)^2.
%F A350051 E.g.f.: (19 + 24*x)*exp(x).
%t A350051 24 * Range[0, 44] + 19 (* _Amiram Eldar_, Dec 18 2021 *)
%o A350051 (PARI) a(n) = 19 + 24*n \\ _Winston de Greef_, Jan 28 2024
%Y A350051 Cf. A008606, 3*A017077, A017101, A348845.
%K A350051 nonn,easy
%O A350051 0,1
%A A350051 _Wolfdieter Lang_, Dec 11 2021