A017365 a(n) = 10*n + 8.

8, 18, 28, 38, 48, 58, 68, 78, 88, 98, 108, 118, 128, 138, 148, 158, 168, 178, 188, 198, 208, 218, 228, 238, 248, 258, 268, 278, 288, 298, 308, 318, 328, 338, 348, 358, 368, 378, 388, 398, 408, 418, 428, 438, 448, 458, 468, 478, 488, 498, 508, 518, 528, 538

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn
• easy

Links

• Vincenzo Librandi, Table of n, a(n) for n = 0..5000
• Tanya Khovanova, Recursive Sequences.
• Index entries for linear recurrences with constant coefficients, signature (2,-1).

Crossrefs

Cf. A016885, A016897.

Programs

Magma

[10*n+8: n in [0..60]]; // Vincenzo Librandi, May 29 2011

Mathematica

Range[8, 1000, 10] (* Vladimir Joseph Stephan Orlovsky, May 28 2011 *)
LinearRecurrence[{2,-1},{8,18},60] (* Harvey P. Dale, Aug 31 2015 *)

Formula

a(n) = 2*a(n-1) - a(n-2). - Vincenzo Librandi, May 29 2011

From R. J. Mathar, Nov 26 2014: (Start)

G.f.: 2*(4+x)/(x-1)^2.

a(n) = 2*A016897(n). (End)

From Elmo R. Oliveira, Apr 04 2025: (Start)

E.g.f.: 2*exp(x)*(4 + 5*x).

a(n) = A016885(2*n+1). (End)