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.

A156376 a(n) = 30*n + 19.

This page as a plain text file.
%I A156376 #34 Dec 08 2024 14:17:15
%S A156376 19,49,79,109,139,169,199,229,259,289,319,349,379,409,439,469,499,529,
%T A156376 559,589,619,649,679,709,739,769,799,829,859,889,919,949,979,1009,
%U A156376 1039,1069,1099,1129,1159,1189,1219,1249,1279,1309,1339,1369,1399,1429,1459,1489
%N A156376 a(n) = 30*n + 19.
%H A156376 Vincenzo Librandi, <a href="/A156376/b156376.txt">Table of n, a(n) for n = 0..1000</a>
%H A156376 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A156376 a(n) = 2*a(n-1) - a(n-2).
%F A156376 G.f.: (19+11*x)/(x-1)^2.
%F A156376 Sum_{n>=0} a(n)/(16*(n+1)^3*(2*n+1)*binomial(2*n+1,n)^2) = zeta(3). - _Daniel Suteu_, Oct 31 2017
%F A156376 E.g.f.: exp(x)*(19 + 30*x). - _Elmo R. Oliveira_, Dec 08 2024
%t A156376 Range[19, 7000, 30] (* _Vladimir Joseph Stephan Orlovsky_, Jul 13 2011 *)
%t A156376 LinearRecurrence[{2, -1}, {19, 49}, 50] (* _Vincenzo Librandi_, Mar 01 2012 *)
%o A156376 (Magma) I:=[19, 49]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..50]]; // _Vincenzo Librandi_, Mar 01 2012
%K A156376 nonn,easy
%O A156376 0,1
%A A156376 _Vincenzo Librandi_, Aug 12 2009
%E A156376 Offset corrected by _R. J. Mathar_, Oct 12 2009