login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A017005 a(n) = 7n + 2. 21

%I #39 Sep 08 2022 08:44:41

%S 2,9,16,23,30,37,44,51,58,65,72,79,86,93,100,107,114,121,128,135,142,

%T 149,156,163,170,177,184,191,198,205,212,219,226,233,240,247,254,261,

%U 268,275,282,289,296,303,310,317,324,331,338,345,352,359,366,373,380

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

%H Vincenzo Librandi, <a href="/A017005/b017005.txt">Table of n, a(n) for n = 0..1120</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 G.f.: (2+5*x)/(1-x)^2.

%F E.g.f.: exp(x)*(2 + 7*x). - _Stefano Spezia_, Mar 21 2021

%F a(n) = 2*a(n-1) - a(n-2). - _Wesley Ivan Hurt_, Mar 22 2021

%t Range[2, 1000, 7] (* _Vladimir Joseph Stephan Orlovsky_, May 27 2011 *)

%t LinearRecurrence[{2,-1},{2,9},60] (* _Harvey P. Dale_, Sep 07 2015 *)

%o (Magma) [ 7*n+2: n in [0..60] ];

%Y Cf. A008589, A016993, A342758.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)