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 A103488 #24 Jul 05 2024 11:23:27
%S A103488 1,8,256,32768,16777216,34359738368,281474976710656,
%T A103488 9223372036854775808,1208925819614629174706176,
%U A103488 633825300114114700748351602688,1329227995784915872903807060280344576,11150372599265311570767859136324180752990208
%N A103488 a(n) = 2^(n^2-1).
%C A103488 From the classic story: number of grains of wheat on last square of n X n chessboard.
%C A103488 Hankel transform of A059304 and of A084771. - _Philippe Deléham_, Dec 02 2007
%C A103488 The number of compositions of n^2. - _Alois P. Heinz_, Feb 22 2020
%H A103488 Vincenzo Librandi, <a href="/A103488/b103488.txt">Table of n, a(n) for n = 1..50</a>
%H A103488 Peter Kagey and William Keehn, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL27/Kagey/kagey6.html">Counting Tilings of the n X m Grid, Cylinder, and Torus</a>, J. Int. Seq. (2024) Vol. 27, Art. No. 24.6.1. See section A, pp. 6, 10.
%F A103488 a(n) = A000079(A005563(n-1)). - _Michel Marcus_, Feb 25 2014
%F A103488 a(n) = A011782(A000290(n)). - _Alois P. Heinz_, Feb 22 2020
%p A103488 [seq(2^(n^2-1),n=1..14)];
%t A103488 Table[2^(n^2 - 1), {n, 1, 20}] (* _Vincenzo Librandi_, Feb 25 2014 *)
%o A103488 (PARI) a(n) = 2^(n^2-1); \\ _Joerg Arndt_, Feb 23 2014
%o A103488 (Magma) [2^(n^2-1): n in [1..15]]; // _Vincenzo Librandi_, Feb 25 2014
%Y A103488 Cf. A000079, A000290, A005563, A011782.
%K A103488 easy,nonn
%O A103488 1,2
%A A103488 _Zerinvary Lajos_, Jul 30 2006