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 A145835 #31 Jul 22 2025 06:14:01 %S A145835 1,12,1434,1691690,19719299768,2271230282824746, %T A145835 2584855762327078145444,29068227444022728740767607050, %U A145835 3230042572278849047360048508956727420,3546545075986984198328715750838554116235343894 %N A145835 Number of compositions of the n X n grid graph. %C A145835 The number of compositions of the n X n grid graph is the number of partitions of an n X n square into regions of orthogonally connected unit squares. %H A145835 A. Knopfmacher and M. E. Mays, <a href="http://www.emis.de/journals/INTEGERS/papers/b4/b4.Abstract.html">Graph compositions I: Basic enumeration</a>, Integers, 1 (2001), #A4. %H A145835 J. N. Ridley and M. E. Mays, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Papers1/42-3/Ridley-Mays-scanned.pdf">Compositions of unions of graphs</a>, Fib. Quart., 42 (2004), 222-230. %H A145835 Frank Simon, <a href="https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa-101154">Algebraic Methods for Computing the Reliability of Networks</a>, Dissertation, Doctor Rerum Naturalium (Dr. rer. nat.), Fakultät Mathematik und Naturwissenschaften der Technischen Universität Dresden, 2012. - From _N. J. A. Sloane_, Jan 04 2013 %e A145835 For n=2 the a(2)=12 partitions of a 2x2 square are: 1 partition into a single 2x2 region; 4 partitions into a 3-square 'L' shape and an isolated corner; 2 partitions into 2 1x2 bricks; 4 partitions into a 1x2 brick and 2 isolated squares; and 1 partition into 4 isolated squares. %Y A145835 Cf. A110476. %K A145835 hard,nonn %O A145835 1,2 %A A145835 _Brian Kell_, Oct 21 2008 %E A145835 Terms for n=7,8,9 from _Frank Simon_, Oct 25 2011 %E A145835 a(10) from Frank Simon's thesis added by _N. J. A. Sloane_, Jan 04 2013