|
Search: id:A094536
|
|
|
| A094536 |
|
Number of binary words of length n that are not "bifix-free". |
|
+0
4
|
|
| 0, 0, 2, 4, 10, 20, 44, 88, 182, 364, 740, 1480, 2980, 5960, 11960, 23920, 47914, 95828, 191804, 383608, 767500, 1535000, 3070568, 6141136, 12283388, 24566776, 49135784, 98271568, 196547560, 393095120, 786199088, 1572398176, 3144813974
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
Equals 2^n - A003000(n).
Let b(0)=1; b(n)=2*b(n-1)-1/2*(1+(-1)^n)*b([n/2]); a(n)=2^n-b(n). - Farideh Firoozbakht (f.firoozbakht(AT)math.ui.ac.ir), Jun 10 2004
|
|
MATHEMATICA
|
b[0]=1; b[n_]:=b[n]=2*b[n-1]-(1+(-1)^n)/2*b[Floor[n/2]]; a[n_]:=2^n-b[n]; Table[a[n], {n, 0, 34}]
|
|
CROSSREFS
|
See A003000 for much more information. Cf. A094537.
Sequence in context: A026644 A026666 A121880 this_sequence A003407 A026395 A090246
Adjacent sequences: A094533 A094534 A094535 this_sequence A094537 A094538 A094539
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, Jun 06 2004
|
|
EXTENSIONS
|
More terms from Farideh Firoozbakht (f.firoozbakht(AT)math.ui.ac.ir), Jun 10 2004
Corrected by Don Rogers (donrogers42(AT)aol.com), Feb 15 2005
|
|
|
Search completed in 0.002 seconds
|
