|
|
A215492
|
|
a(n) = 21*a(n-2) + 7*a(n-3), with a(0)=0, a(1)=3, and a(2)=6.
|
|
3
|
|
|
0, 3, 6, 63, 147, 1365, 3528, 29694, 83643, 648270, 1964361, 14199171, 45789471, 311933118, 1060973088, 6871121775, 24463966674, 151720368891, 561841152579, 3357375513429, 12860706786396, 74437773850062, 293576471108319, 1653218198356074, 6686170310225133
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
We have a(n)=B(n;3), where B(n;d), n=1,2,..., d \in C, denote one of the quasi-Fibonacci numbers defined in the comments to A121449 and in the Witula-Slota-Warzynski paper. Its conjugate sequences A(n;3) and C(n;3) are discussed in A121458 and A215484 respectively. Similarly as in A121458 we deduce that each of the following elements a(3*n), a(3*n+1), a(3*n+2) is divided by 3*7^n for every n=0,1,... .
|
|
LINKS
|
|
|
FORMULA
|
a(n) = (1/7)*((c(1)-c(4))*(1+3*c(1))^n + (c(2)-c(1))*(1+3*c(2))^n + (c(4)-c(2))*(1+3*c(4))^n), where c(j):=2*cos(2*Pi*j/7) (for the proof see Witula-Slota-Warzynski paper).
G.f.: (3*x+6*x^2)/(1-21*x^2-7*x^3).
|
|
MATHEMATICA
|
LinearRecurrence[{0, 21, 7}, {0, 3, 6}, 50]
CoefficientList[Series[(3 x + 6 x^2)/(1 - 21 x^2 - 7 x^3), {x, 0, 33}], x] (* Vincenzo Librandi, Sep 18 2015 *)
|
|
PROG
|
(Magma) I:=[0, 3, 6]; [n le 3 select I[n] else 21*Self(n-2)+7*Self(n-3): n in [1..30]]; // Vincenzo Librandi, Sep 18 2015
|
|
CROSSREFS
|
Cf. A121458, A215484, A121449, A085810, A215404, A077998, A006054, A033304, A052975, A094789, A005021, A121442, A121458.
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|