Juris Cernenoks has authored 2 sequences.
A238381
Minimal number of V-trominoes needed to prevent any further V-trominoe from being placed on an n X n grid.
Original entry on oeis.org
0, 1, 2, 3, 4, 6, 8, 11, 14, 18, 21, 25, 30, 35, 40
Offset: 1
A214294
The maximum number of V-pentominoes covering the cells of square n × n.
Original entry on oeis.org
0, 0, 1, 2, 4, 6, 8, 12, 14, 18, 22, 27, 32, 37, 43, 49, 55, 62, 69, 77
Offset: 1
Juris Čerņenoks, Jul 10 2012
There is no way to cover square 3 × 3 with more than just one V-pentomino so a(3)=1.
- A. Cibulis, Equal Pentominoes on the Chessboard, j. "In the World of Mathematics", Kyiv, Vol. 4., No. 3, pp. 80-85, 1998. (In Ukrainian), http://www.probability.univ.kiev.ua/WorldMath/mathw.html
- A. Cibulis, Pentominoes, Part I, Riga, University of Latvia, 2001, 96 p. (In Latvian)
- A. Cibulis, From Olympiad Problems to Unsolved Ones, The 12th International Conference "Teaching Mathematics: Retrospective and Perspectives", Šiauliai University, Abstracts, pp. 19-20, 2011.
Comments