OFFSET
1,2
REFERENCES
Hsien-Kuei Hwang, S Janson, TH Tsai, Exact and asymptotic solutions of the recurrence f(n) = f(floor(n/2)) + f(ceiling(n/2)) + g(n): theory and applications, Preprint, 2016; http://140.109.74.92/hk/wp-content/files/2016/12/aat-hhrr-1.pdf. Also Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications, ACM Transactions on Algorithms, 13:4 (2017), #47; DOI: 10.1145/3127585
LINKS
Index entries for linear recurrences with constant coefficients, signature (1, 1, -1).
FORMULA
From Bruno Berselli, Oct 06 2010: (Start)
G.f.: x^2*(6+x)/((1+x)*(1-x)^2).
a(n) - a(n-1) - a(n-2) + a(n-3) = 0 (n > 3).
a(n) = (14*n + 5*(-1)^n - 9)/4.
a(n) - a(n-2) = 7 (n > 2).
a(n) - a(n-1) = A010687(k) with n > 1 and k == n-1 (mod 2). (End)
a(n+1) = Sum_{k>=0} A030308(n,k)*b(k) with b(0)=6 and b(k) = 7*2^(k-1) = A005009(k-1) for k > 0. - Philippe Deléham, Oct 18 2011
MATHEMATICA
Select[Range[0, 200], MemberQ[{0, 6}, Mod[#, 7]]&] (* Harvey P. Dale, Mar 16 2011 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved