34867

Appears in sequences

• A thinks of x in set M; B asks questions: is x in T?; A may lie once but only when true answer is Yes; a(n) is maximal size of M such that B can determine x with <= n questions.at n=17A010033
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 21 ones.at n=18A031789
• Number of nX5 binary arrays with every 1 having exactly two king-move neighbors equal to 1.at n=6A183446
• Number of nX7 binary arrays with every 1 having exactly two king-move neighbors equal to 1.at n=4A183448
• T(n,k)=Number of nXk binary arrays with every 1 having exactly two king-move neighbors equal to 1.at n=59A183450
• T(n,k)=Number of nXk binary arrays with every 1 having exactly two king-move neighbors equal to 1.at n=61A183450
• Number of partitions of n containing a clique of size 6.at n=46A183563
• Absolute discriminants of complex quadratic fields with 3-class group of type (3,3) and Hilbert 3-class field tower of exact length 3, except for the cases mentioned in the COMMENTS.at n=14A242878
• Minimal absolute discriminants a(n) of complex quadratic fields with 3-class group of type (3,3), 3-principalization type E.8 (2234), and second 3-class group G of odd nilpotency class cl(G)=2(n+2)+1.at n=0A247695
• a(n) is the number of polynomials of degree 2*n over the field GF(2) that have no factors of odd degree.at n=9A338862