This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A017029 a(n) = 7*n + 4. 20

%I

%S 4,11,18,25,32,39,46,53,60,67,74,81,88,95,102,109,116,123,130,137,144,

%T 151,158,165,172,179,186,193,200,207,214,221,228,235,242,249,256,263,

%U 270,277,284,291,298,305,312,319,326,333,340,347,354,361,368,375,382

%N a(n) = 7*n + 4.

%H Vincenzo Librandi, <a href="/A017029/b017029.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 G.f.: (3*x + 4)/(1-x)^2. - _Vincenzo Librandi_, Jan 27 2013

%t Range[4,1000,7] (* _Vladimir Joseph Stephan Orlovsky_, Jun 25 2009 *)

%t CoefficientList[Series[(3*x + 4)/(1 - x)^2, {x, 0, 60}], x] (* _Vincenzo Librandi_, Jan 27 2013 *)

%o (MAGMA) [7*n + 4: n in [0..60]]; // _Vincenzo Librandi_, Jun 18 2011

%o (PARI) a(n)=7*n+4 \\ _Charles R Greathouse IV_, Jul 10 2016

%Y Cf. A008589, A016993, A017005, A017017.

%Y Cf. similar sequences with closed form (2*k-1)*n+k listed in A269044.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

%E Extended by _Ray Chandler_, Jan 25 2005

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

Last modified April 19 18:37 EDT 2019. Contains 322290 sequences. (Running on oeis4.)