This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A017473 a(n) = 11*n + 7. 15
 7, 18, 29, 40, 51, 62, 73, 84, 95, 106, 117, 128, 139, 150, 161, 172, 183, 194, 205, 216, 227, 238, 249, 260, 271, 282, 293, 304, 315, 326, 337, 348, 359, 370, 381, 392, 403, 414, 425, 436, 447, 458, 469, 480, 491, 502, 513, 524, 535, 546, 557, 568, 579, 590 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..10000 Tanya Khovanova, Recursive Sequences Index entries for linear recurrences with constant coefficients, signature (2,-1). FORMULA From Colin Barker, Jun 06 2012: (Start) a(n) = 2*a(n-1) - a(n-2). G.f.: (7 + 4*x)/(1-x)^2. (End) E.g.f.: (7 + 11*x)*exp(x). - G. C. Greubel, Sep 19 2019 MAPLE seq(11*n+7, n=0..60); # G. C. Greubel, Sep 19 2019 MATHEMATICA Range[7, 1000, 11] (* Vladimir Joseph Stephan Orlovsky, May 29 2011 *) PROG (MAGMA) [(11*n+7): n in [0..60]]; // Vincenzo Librandi, Sep 04 2011 (PARI) vector(60, n, 11*n-4) \\ G. C. Greubel, Sep 19 2019 (Sage) [11*n+7 for n in (0..60)] # G. C. Greubel, Sep 19 2019 (GAP) List([0..60], n-> 11*n+7); # G. C. Greubel, Sep 19 2019 CROSSREFS Cf. A008593, A017401, A017413. Powers of the form (11*n+7)^m: this sequence (m=1), A017474 (m=2), A017475 (m=3), A017476 (m=4), A017477 (m=5), A017478 (m=6), A017479 (m=7), A017480 (m=8), A017481 (m=9), A017482 (m=10), A017483 (m=11), A017484 (m=12). Sequence in context: A242293 A179298 A144175 * A131191 A061876 A103571 Adjacent sequences:  A017470 A017471 A017472 * A017474 A017475 A017476 KEYWORD nonn,easy AUTHOR STATUS approved

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 October 23 07:11 EDT 2019. Contains 328336 sequences. (Running on oeis4.)