OFFSET
0,5
LINKS
Harry J. Smith, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4, -6, 4, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -4, 6, -4, 1).
FORMULA
a(n) = floor(A000583(n)/64) = floor(A011863(n-1)/4). a(2n) = A059403(2n); a(2n-1) = A059403(2n-1) + A011861(n).
From R. J. Mathar, Mar 24 2011: (Start)
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) + a(n-16) - 4*a(n-17) + 6*a(n-18) - 4*a(n-19) + a(n-20).
G.f.: -x^3 *(1 - x^2 + 4*x^3 - 4*x^4 - 3*x^6 + 4*x^7 - 3*x^8 + 4*x^9 - 4*x^10 + 4*x^11 - x^12 + x^14 + 4*x^5) / ( (1+x) *(x^2+1) *(x^4+1) *(x^8+1) *(x-1)^5 ). (End)
EXAMPLE
a(9) = floor(9^4/64) = floor(6561/64) = floor(102.51562...) = 102.
MATHEMATICA
Floor[Range[0, 50]^4/64] (* or *) LinearRecurrence[ {4, -6, 4, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -4, 6, -4, 1}, {0, 0, 0, 1, 4, 9, 20, 37, 64, 102, 156, 228, 324, 446, 600, 791, 1024, 1305, 1640, 2036}, 50] (* Harvey P. Dale, May 30 2014 *)
PROG
(PARI) a(n) = { n^4\64 } \\ Harry J. Smith, Jul 06 2009
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Henry Bottomley, Mar 21 2001
STATUS
approved