This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A214294 #20 Sep 06 2025 22:28:11 %S A214294 0,0,1,2,4,6,8,12,14,18,22,27,32,37,43,49,55,62,69,77 %N A214294 The maximum number of V-pentominoes covering the cells of square n X n. %C A214294 The problem of determining the maximum number of V-pentominoes (or the densest packing) covering the cells of the square n X n was proposed by A. Cibulis. %C A214294 Problem for the squares 5 X 5, 6 X 6 and 8 X 8 was given in the Latvian Open Mathematics Olympiad 2000 for Forms 6, 8 and 5 respectively. %C A214294 Solutions for the squares 3 X 3, 5 X 5, 8 X 8, 12 X 12, 16 X 16 are unique under rotation and reflection. %D A214294 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 %D A214294 A. Cibulis, Pentominoes, Part I, Riga, University of Latvia, 2001, 96 p. (In Latvian) %D A214294 A. Cibulis, From Olympiad Problems to Unsolved Ones, The 12th International Conference "Teaching Mathematics: Retrospective and Perspectives", Šiauliai University, Abstracts, pp. 19-20, 2011. %e A214294 There is no way to cover square 3 X 3 with more than just one V-pentomino so a(3)=1. %K A214294 nonn,more,changed %O A214294 1,4 %A A214294 _Juris Cernenoks_, Jul 10 2012