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 A329927 #14 Mar 28 2020 10:12:48 %S A329927 1,1,1,1,16,1,32,1,48,1,64,256,1,80,768,1,96,1536,1,112,2560,4096,1, %T A329927 128,3840,16384,1,144,5376,40960,1,160,7168,81920,65536,1,176,9216, %U A329927 143360,327680,1,192,11520,229376,983040,1,208,14080,344064,2293760,1048576,1 %N A329927 a(n) is the number of squares with largest size after n iterations of the "Square Multiscale" substitution. %C A329927 See A329919 for further details about the "Square Multiscale" substitution. %C A329927 This sequence only contains ones and multiples of 16; the ones correspond to situations where the central square is the largest. %H A329927 Rémy Sigrist, <a href="/A329927/b329927.txt">Table of n, a(n) for n = 0..10000</a> %H A329927 Rémy Sigrist, <a href="/A329927/a329927.gp.txt">PARI program for A329927</a> %H A329927 Yotam Smilansky, Yaar Solomon, <a href="https://arxiv.org/abs/2003.11735">Multiscale Substitution Tilings</a>, arXiv:2003.11735 [math.DS], 2020. %F A329927 a(n) = (A329919(n+1) - A329919(n)) / 16. %o A329927 (PARI) See Links section. %Y A329927 Cf. A328074, A329919. %K A329927 nonn %O A329927 0,5 %A A329927 _Rémy Sigrist_, Nov 24 2019