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 A017353 #38 Apr 06 2025 14:59:28 %S A017353 7,17,27,37,47,57,67,77,87,97,107,117,127,137,147,157,167,177,187,197, %T A017353 207,217,227,237,247,257,267,277,287,297,307,317,327,337,347,357,367, %U A017353 377,387,397,407,417,427,437,447,457,467,477,487,497,507,517,527,537 %N A017353 a(n) = 10*n + 7. %H A017353 Vincenzo Librandi, <a href="/A017353/b017353.txt">Table of n, a(n) for n = 0..5000</a> %H A017353 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>. %H A017353 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A017353 From _Vincenzo Librandi_, May 28 2011: (Start) %F A017353 a(n) = 10*n + 7. %F A017353 a(n) = 2*a(n-1) - a(n-2). (End) %F A017353 G.f.: (7+3*x)/(x-1)^2. - _Wesley Ivan Hurt_, Mar 26 2015 %F A017353 From _Elmo R. Oliveira_, Apr 05 2025: (Start) %F A017353 E.g.f.: exp(x)*(7 + 10*x). %F A017353 a(n) = A016873(2*n+1). (End) %p A017353 A017353:=n->10*n+7: seq(A017353(n), n=0..70); # _Wesley Ivan Hurt_, Mar 26 2015 %t A017353 Range[7, 497, 10] (* _Vladimir Joseph Stephan Orlovsky_, May 28 2011 *) %o A017353 (Magma) [10*n+7: n in [0..60]]; // _Vincenzo Librandi_, May 28 2011 %o A017353 (PARI) vector(100,n,10*n-3) \\ _Derek Orr_, Mar 29 2015 %Y A017353 Cf. A008592, A016873, A017341. %K A017353 nonn,easy %O A017353 0,1 %A A017353 _N. J. A. Sloane_