A102689 a(n) = 10000*n + 2468.

2468, 12468, 22468, 32468, 42468, 52468, 62468, 72468, 82468, 92468, 102468, 112468, 122468, 132468, 142468, 152468, 162468, 172468, 182468, 192468, 202468, 212468, 222468, 232468, 242468, 252468, 262468, 272468, 282468, 292468, 302468, 312468, 322468, 332468, 342468

Offset

0,1

Links

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Tanya Khovanova, Recursive Sequences.

Index entries for linear recurrences with constant coefficients, signature (2,-1).

Formula

From Elmo R. Oliveira, Dec 07 2024: (Start)

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

E.g.f.: 4*exp(x)*(617 + 2500*x).

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

Mathematica

Table[10000*n+2468, {n, 0, 50}] (* Harvey P. Dale, Feb 24 2015 *)
LinearRecurrence[{2, -1}, {2468, 12468}, 50] (* Vincenzo Librandi, Aug 16 2017 *)

Prog

(Magma) [10000*n+2468: n in [0..50]]; // Vincenzo Librandi, Aug 16 2017

Crossrefs

Sequence in context: A182381 A284089 A252113 * A082253 A253229 A253348

Adjacent sequences: A102686 A102687 A102688 * A102690 A102691 A102692

Keyword

easy,nonn,less

Author

Giovanni Teofilatto, Feb 25 2005

Status

approved