# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a209356 Showing 1-1 of 1 %I A209356 #7 Dec 21 2015 04:31:00 %S A209356 2,2,2,3,3,3,4,4,4,4,5,5,6 %N A209356 The function g(n), the inverse of f(k) the shortest length of a binary linear intersecting code. %C A209356 Table 1, p. 4 of Alahmadi, of g(n) for 3 <= n <= 15. %D A209356 N. J. A. Sloane, Covering Arrays and Intersecting Codes, J. Combinatorial Designs, 1 (1993), 51-63. %H A209356 A. Alahmadi, R. E. L. Aldred, R. dela Cruz, P. Solé, C. Thomassen, The maximum number of minimal codewords in an [n,k]-code, arXiv:1203.0728v1 [cs.IT], Mar 4, 2012. %Y A209356 Cf. A209334. %K A209356 nonn %O A209356 3,1 %A A209356 _Jonathan Vos Post_, Mar 06 2012 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE