OFFSET
1,1
LINKS
Colin Barker, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).
FORMULA
a(n) = 11*n - 6 + 2*(-1)^n.
a(n) = 11*n - A105398(n + 4).
From Colin Barker, Feb 07 2019: (Start)
G.f.: x*(3 + 15*x + 4*x^2) / ((1 - x)^2*(1 + x)).
a(n) = a(n - 1) + a(n - 2) - a(n - 3) for n > 3. (End)
E.g.f.: 4 + (11*x - 6)*exp(x) + 2*exp(-x). - David Lovler, Sep 08 2022
MAPLE
seq(seq(22*i+j, j=[3, 18]), i=0..200);
MATHEMATICA
Select[Range[200], MemberQ[{3, 18}, Mod[#, 22]] &]
Flatten[Table[{22n + 3, 22n + 18}, {n, 0, 43}]] (* Alonso del Arte, Feb 18 2019 *)
PROG
(PARI) for(n=3, 678, if((n%22==3) || (n%22==18), print1(n, ", ")))
(PARI) vector(62, n, 11*n-6+2*(-1)^n)
(PARI) Vec(x*(3 + 15*x + 4*x^2) / ((1 - x)^2*(1 + x)) + O(x^40)) \\ Colin Barker, Feb 07 2019
(Scala) (3 to 949 by 22).union(18 to 942 by 22).sorted // Alonso del Arte, Feb 18 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Davis Smith, Feb 02 2019
STATUS
approved