Number of words of n-length n words on {0,1,2,3,4} avoiding runs of zeros of length 1 (mod 3).
RecurrenceTable[{a[0] == 1, a[1] == 4, a[2] == 17, a[n] == 4*a[n - 1] + 5*a[n - 3]}, a[n], {n, 0, 23}]
nonn,easy,changed
proposed
approved
Number of words of n-length n words on {0,1,2,3,4} avoiding runs of zeros of length 1 (mod 3).
RecurrenceTable[{a[0] == 1, a[1] == 4, a[2] == 17, a[n] == 4*a[n - 1] + 5*a[n - 3]}, a[n], {n, 0, 23}]
nonn,easy,changed
proposed
approved
editing
proposed
Number of n-words of length words n on {0,1,2,3,4} avoiding runs of zeros of length 1 (mod 3).
RecurrenceTable[{a[0] == 1, a[1] == 4, a[2] == 17, a[n] == 4*a[n - 1] + 5*a[n - 3]}, a[n], {n, 0, 23}]
approved
editing
editing
approved
G.f.: ( -1-x^2 ) / ( -1+4*x+5*x^3 ). - R. J. Mathar, Nov 07 2015
approved
editing
editing
approved
<a href="/index/Rec#order_0203">Index entries for linear recurrences with constant coefficients</a>, signature (4,0,5).
approved
editing
<a href="/index/Rec#order_02">Index to sequences with entries for linear recurrences with constant coefficients</a>, signature (4,0,5).
editing
approved