|
Search: id:A019309
|
|
|
| A019309 |
|
Number of "bifix-free" words of length n over a four-letter alphabet. |
|
+0
5
|
|
| 1, 4, 12, 48, 180, 720, 2832, 11328, 45132, 180528, 721392, 2885568, 11539440, 46157760, 184619712, 738478848, 2953870260, 11815481040, 47261743632, 189046974528, 756187176720, 3024748706880, 12098991941952
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
P. Tolstrup Nielsen, A note on bifix-free sequences, IEEE Trans. Inform. Theory IT-19 (1973), 704-706.
|
|
LINKS
|
T. Harju and D. Nowotka, Border correlation of binary words.
|
|
FORMULA
|
a(2n+1) = 4a(2n); a(2n) = 4a(2n-1) - a(n).
|
|
MATHEMATICA
|
a[0]=1; a[n_]:=a[n]=4*a[n-1]-If[EvenQ[n], a[n/2], 0] (Ed Pegg, Jr., (ed(AT)mathpuzzle.com), Jan 05 2005)
|
|
CROSSREFS
|
Cf. A003000, A019308, A094547, A094559, A094578.
Sequence in context: A081620 A063887 A108508 this_sequence A056632 A092898 A110594
Adjacent sequences: A019306 A019307 A019308 this_sequence A019310 A019311 A019312
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Jeffrey Shallit (shallit(AT)graceland.uwaterloo.ca)
|
|
|
Search completed in 0.002 seconds
|
