OFFSET
1,3
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..10001
Giulio Cerbai, Pattern-avoiding modified ascent sequences, arXiv:2401.10027 [math.CO], 2024. See p. 28.
Index entries for linear recurrences with constant coefficients, signature (2,-2,2,-2,2,-1).
FORMULA
G.f.: x^2*(x^4+x^3+x^2+1)/((x-1)^2*(x^2-x+1)*(x^2+x+1)). - Colin Barker, Jun 22 2012
From Wesley Ivan Hurt, Jun 16 2016: (Start)
a(n) = 2*a(n-1)-2*a(n-2)+2*a(n-3)-2*a(n-4)+2*a(n-5)-a(n-6) for n>6.
a(n) = (24*n-30+6*sqrt(3)*cos((1-2n)*Pi/6)+2*sqrt(3)*cos((1+4n)*Pi/6))/18.
a(6k) = 8k-1, a(6k-1) = 8k-3, a(6k-2) = 8k-5, a(6k-3) = 8k-6, a(6k-4) = 8k-7, a(6k-5) = 8k-8. (End)
Sum_{n>=2} (-1)^n/a(n) = (2*sqrt(2)-3)*Pi/16 + (5-sqrt(2))*log(2)/8 + sqrt(2)*log(sqrt(2)+2)/4. - Amiram Eldar, Dec 26 2021
MAPLE
A047490:=n->(24*n-30+6*sqrt(3)*cos((1-2*n)*Pi/6)+2*sqrt(3)*cos((1+4*n)*Pi/6))/18: seq(A047490(n), n=1..100); # Wesley Ivan Hurt, Jun 16 2016
MATHEMATICA
Select[Range[0, 100], MemberQ[{0, 1, 2, 3, 5, 7}, Mod[#, 8]] &] (* Wesley Ivan Hurt, Jun 16 2016 *)
PROG
(Magma) [n : n in [0..100] | n mod 8 in [0, 1, 2, 3, 5, 7]]; // Wesley Ivan Hurt, Jun 16 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved