|
Search: id:A034188
|
|
|
| A034188 |
|
Number of binary codes of length 3 with n words. |
|
+0
65
|
|
| 1, 1, 3, 3, 6, 3, 3, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
H. Fripertinger, Enumeration, construction and random generation of block codes, Designs, Codes, Crypt., 14 (1998), 213-219.
|
|
LINKS
|
H. Fripertinger, Isometry Classes of Codes
|
|
FORMULA
|
a(n)=[C(2*n,n) mod 2]+{C[(n+1)^2,n+3] mod 2}+3*[C(n^2,n+2) mod 2]+3*{C[(n+11)^4,n+13] mod 2}+6*{C[(n+10)^4,n+12] mod 2}+3*{C[(n+9)^4,n+11] mod 2}+3*{C[(n+8)^4,n+10] mod 2}+{C[(n+7)^4,n+9] mod 2}+{C[(n+6)^4,n+8] mod 2} - Paolo P. Lava (ppl(AT)spl.at), Jan 07 2008
|
|
CROSSREFS
|
Cf. A034189-.
Sequence in context: A066519 A105158 A020813 this_sequence A040007 A110634 A113397
Adjacent sequences: A034185 A034186 A034187 this_sequence A034189 A034190 A034191
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
