A248339 a(n) = 22*n + 19.

19, 41, 63, 85, 107, 129, 151, 173, 195, 217, 239, 261, 283, 305, 327, 349, 371, 393, 415, 437, 459, 481, 503, 525, 547, 569, 591, 613, 635, 657, 679, 701, 723, 745, 767, 789, 811, 833, 855, 877, 899, 921, 943, 965, 987, 1009

Offset

0,1

Comments

These are the odd numbers in A017485.

Solutions to 11^x + 13^x == 17 mod 23.

A141855 is the subsequence of primes.

Links

Karl V. Keller, Jr., Table of n, a(n) for n = 0..1000

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

Formula

a(n) = 22*n + 19.

From Colin Barker, Oct 05 2014: (Start)

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

G.f.: (19 + 3*x) / (1-x)^2. (End)

E.g.f.: (19 + 22*x)*exp(x). - G. C. Greubel, Nov 13 2024

Example

For n = 4, 22*4 + 19 = 107.

Mathematica

22*Range[0, 50]+19 (* Harvey P. Dale, Dec 20 2014 *)
(* Alternative: *)
LinearRecurrence[{2, -1}, {19, 41}, 50] (* Harvey P. Dale, Dec 20 2014 *)

Prog

(Python)
for n in range(101):
    print(22*n+19, end=', ')
(PARI)
Vec((3*x+19)/(x-1)^2 + O(x^100)) \\ Colin Barker, Oct 05 2014
(Magma) [22*n+19: n in [0..60]]; // G. C. Greubel, Nov 13 2024

Crossrefs

Cf. A017485 (11*n+8), A141855.

Sequence in context: A029489 A155024 A323391 * A133855 A280170 A262608

Adjacent sequences: A248336 A248337 A248338 * A248340 A248341 A248342

Keyword

nonn,easy,changed

Author

Karl V. Keller, Jr., Oct 05 2014

Status

approved