A082286 a(n) = 18*n + 10.

10, 28, 46, 64, 82, 100, 118, 136, 154, 172, 190, 208, 226, 244, 262, 280, 298, 316, 334, 352, 370, 388, 406, 424, 442, 460, 478, 496, 514, 532, 550, 568, 586, 604, 622, 640, 658, 676, 694, 712, 730, 748, 766, 784, 802, 820, 838, 856, 874, 892, 910, 928, 946

Offset: 0

Author

Cino Hilliard, May 10 2003

Keywords

• easy
• nonn

Comments

Solutions to (11^x + 13^x) mod 19 = 17.

Links

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

Crossrefs

Cf. A006370, A008600, A016945, A161705.

Cf. A000217, A017221, A022267, A060544.

Programs

Magma

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

Mathematica

Range[10, 1000, 18] (* Vladimir Joseph Stephan Orlovsky, Jun 01 2011 *)

PARI

a(n)=18*n+10 \\ Charles R Greathouse IV, Jul 10 2016

Formula

a(n) = A006370(A016945(n)). - Reinhard Zumkeller, Apr 17 2008

a(n) = 2*A017221(n). - Michel Marcus, Feb 15 2014

a(n) = A060544(n+2) - 9*A000217(n-1). - Leo Tavares, Oct 15 2022

From Elmo R. Oliveira, Apr 08 2024: (Start)

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

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

a(n) = 2*a(n-1) - a(n-2) for n >= 2.

a(n) = 2*(A022267(n+1) - A022267(n)). (End)

Extensions

More terms from Reinhard Zumkeller, Apr 17 2008