|
Search: id:A054200
|
|
|
| A054200 |
|
Number of binary vectors (x_1,...x_n) satisfying Sum_{i=1..n} i*x_i = 3 (mod n+1) = size of Varshamov-Tenengolts code VT_3(n). |
|
+0
1
|
|
| 1, 1, 2, 2, 3, 6, 9, 16, 29, 51, 93, 172, 315, 585, 1094, 2048, 3855, 7285, 13797, 26214, 49938, 95325, 182361, 349536, 671088, 1290555, 2485532, 4793490, 9256395, 17895730, 34636833, 67108864, 130150586, 252645135, 490853403
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
N. J. A. Sloane, On single-deletion-correcting codes, in Codes and Designs (Columbus, OH, 2000), 273-291, Ohio State Univ. Math. Res. Inst. Publ., 10, de Gruyter, Berlin, 2002.
|
|
LINKS
|
N. J. A. Sloane, On single-deletion-correcting codes
|
|
CROSSREFS
|
For the codes VT_0(n), VT_1(n), VT_2(n) see resp. A000016, A000048, A000048 (again).
Sequence in context: A019465 A077074 A163493 this_sequence A137216 A070550 A145778
Adjacent sequences: A054197 A054198 A054199 this_sequence A054201 A054202 A054203
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Apr 29 2000
|
|
|
Search completed in 0.002 seconds
|
