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.

A158060 a(n) = 25*n + 1.

This page as a plain text file.
%I A158060 #26 Apr 03 2025 18:02:18
%S A158060 26,51,76,101,126,151,176,201,226,251,276,301,326,351,376,401,426,451,
%T A158060 476,501,526,551,576,601,626,651,676,701,726,751,776,801,826,851,876,
%U A158060 901,926,951,976,1001,1026,1051,1076,1101,1126,1151,1176,1201,1226,1251
%N A158060 a(n) = 25*n + 1.
%H A158060 Vincenzo Librandi, <a href="/A158060/b158060.txt">Table of n, a(n) for n = 1..10000</a>
%H A158060 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A158060 a(n) = 2*a(n-1) - a(n-2).
%F A158060 G.f.: x*(26-x)/(x-1)^2.
%F A158060 E.g.f.: exp(x)*(25*x + 1) - 1. - _Elmo R. Oliveira_, Apr 03 2025
%t A158060 LinearRecurrence[{2,-1},{26,51},50]
%t A158060 Range[26, 2000, 25] (* _Vladimir Joseph Stephan Orlovsky_, Jun 14 2011 *)
%t A158060 25*Range[50]+1 (* _Harvey P. Dale_, Nov 23 2018 *)
%o A158060 (Magma) I:=[26, 51]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..60]];
%o A158060 (PARI) a(n)=25*n+1 \\ _Charles R Greathouse IV_, Jun 14 2011
%K A158060 nonn,easy
%O A158060 1,1
%A A158060 _Vincenzo Librandi_, Mar 12 2009