login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = 10n + 7.
20

%I #34 Sep 08 2022 08:44:42

%S 7,17,27,37,47,57,67,77,87,97,107,117,127,137,147,157,167,177,187,197,

%T 207,217,227,237,247,257,267,277,287,297,307,317,327,337,347,357,367,

%U 377,387,397,407,417,427,437,447,457,467,477,487,497,507,517,527,537

%N a(n) = 10n + 7.

%H Vincenzo Librandi, <a href="/A017353/b017353.txt">Table of n, a(n) for n = 0..5000</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).

%F From _Vincenzo Librandi_, May 28 2011: (Start)

%F a(n) = 10*n + 7.

%F a(n) = 2*a(n-1) - a(n-2). (End)

%F G.f.: (7+3*x)/(x-1)^2. - _Wesley Ivan Hurt_, Mar 26 2015

%p A017353:=n->10*n+7: seq(A017353(n), n=0..70); # _Wesley Ivan Hurt_, Mar 26 2015

%t Range[7, 497, 10] (* _Vladimir Joseph Stephan Orlovsky_, May 28 2011 *)

%o (Magma) [10*n+7: n in [0..60]]; // _Vincenzo Librandi_, May 28 2011

%o (PARI) vector(100,n,10*n-3) \\ _Derek Orr_, Mar 29 2015

%Y Cf. A008592, A017341.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_