A247413 Decimal expansion of the entropy constant related to A063443.
1, 3, 4, 2, 6, 4, 3, 9, 5, 1, 1, 2, 4
Offset: 1
Examples
1.342643951124...
References
- Steven R. Finch, Mathematical Constants, Cambridge, 2003, p. 343.
- B. D. McKay, On Calkin and Wilf's limit theorem for grid graphs, unpublished note, 1996.
Links
- N. J. Calkin, K. James, and S. Purvis, Counting Kings, 2006, p.9.
- N. J. Calkin and H. S. Wilf, The number of independent sets in a grid graph, preprint, 1995.
- N. J. Calkin and H. S. Wilf, The number of independent sets in a grid graph, SIAM J. Discrete Math, 11 (1998) 54-60.
- Steven R. Finch, Several Constants Arising in Statistical Mechanics, arXiv:math/9810155 [math.CO], 1999, p.8.
- Vaclav Kotesovec, Non-attacking chess pieces, 6ed, 2013, p.68-69.
- D. E. Knuth, Nonattacking kings on a chessboard, 1994.
- M. Larsen, The Problem of Kings, The Electronic Journal of Combinatorics 2, 1995.
- Kai Liang, Independent Set Enumeration in King Graphs by Tensor Network Contractions, arXiv:2505.12776 [math.CO], 2025. See p. 6.
- Eric Weisstein's World of Mathematics, Hard Hexagon Entropy Constant
- Eric Weisstein's World of Mathematics, Hard Square Entropy Constant
- H. S. Wilf, The problem of the kings, Elec. J. Combin. 2, 1995.