|
Search: id:A019308
|
|
|
| A019308 |
|
Number of "bifix-free" words of length n over a three-letter alphabet. |
|
+0
7
|
|
| 1, 3, 6, 18, 48, 144, 414, 1242, 3678, 11034, 32958, 98874, 296208, 888624, 2664630, 7993890, 23977992, 71933976, 215790894, 647372682, 1942085088, 5826255264, 17478666918, 52436000754, 157307706054, 471923118162
(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) = 3a(2n); a(2n) = 3a(2n-1) - a(n).
|
|
MATHEMATICA
|
a[0]=1; a[n_]:=a[n]=3*a[n-1]-If[EvenQ[n], a[n/2], 0] (Ed Pegg, Jr., (ed(AT)mathpuzzle.com), Jan 05 2005)
|
|
CROSSREFS
|
Equals 3*A045694(n) for n>0. Cf. A003000, A019309.
Sequence in context: A148559 A108507 A083337 this_sequence A000932 A161006 A148560
Adjacent sequences: A019305 A019306 A019307 this_sequence A019309 A019310 A019311
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jeffrey Shallit (shallit(AT)graceland.uwaterloo.ca)
|
|
|
Search completed in 0.003 seconds
|
