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 A112414 #16 Oct 30 2024 21:44:39
%S A112414 7,10,13,16,19,22,25,28,31,34,37,40,43,46,49,52,55,58,61,64,67,70,73,
%T A112414 76,79,82,85,88,91,94,97,100,103,106,109,112,115,118,121,124,127,130,
%U A112414 133,136,139,142,145,148,151,154,157,160,163,166,169,172,175,178,181,184
%N A112414 a(n) = 3*n + 7.
%C A112414 At least the first 2 million terms from a(1) on coincide with the corresponding terms of A086822(n+2). - _R. J. Mathar_, Aug 15 2008
%H A112414 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H A112414 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A112414 From _Elmo R. Oliveira_, Oct 30 2024: (Start)
%F A112414 G.f.: (7 - 4*x)/(1 - x)^2.
%F A112414 E.g.f.: (7 + 3*x)*exp(x).
%F A112414 a(n) = 2*a(n-1) - a(n-2) for n >= 2.
%F A112414 a(n) = A016933(n+2)/2 = A059845(n+1) - A059845(n). (End)
%t A112414 3Range[0,70]+7 (* or *) LinearRecurrence[{2,-1},{7,10},70] (* _Harvey P. Dale_, May 12 2019 *)
%o A112414 (PARI) a(n)=3*n+7 \\ _Charles R Greathouse IV_, Jul 10 2016
%Y A112414 Cf. A016933, A059845.
%K A112414 easy,nonn
%O A112414 0,1
%A A112414 _Zerinvary Lajos_, Dec 09 2005
%E A112414 Better definition from _T. D. Noe_, Nov 30 2006