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 A277015 #12 Oct 04 2016 13:30:36 %S A277015 0,4,8,12,16,19,20,24,36,40,45,48,56,60,68,72,80,83,84,92,96,104,109, %T A277015 112,120,124,132,136,140,144,147,148,156,160,164,168,173,176,180,192, %U A277015 204,208,211,216,220,224,228,232,237,240,252,264,272,275,276,280,284 %N A277015 Numbers whose squares are present in A276573 (the infinite trunk of least squares beanstalk). %C A277015 Indexing starts from zero because a(0)=0 is a special case in this sequence. %H A277015 Antti Karttunen, <a href="/A277015/b277015.txt">Table of n, a(n) for n = 0..130</a> %F A277015 a(n) = A000196(A277016(n)) = A000196(A276573(A277014(n))). %o A277015 (Scheme) (define (A277015 n) (A000196 (A277016 n))) %Y A277015 Cf. A000196, A002828, A276573, A277014, A277016 (the corresponding squares), A277025 (multiples of four present / 4). %Y A277015 Positions of squares in A277023, zeros in A277024. %K A277015 nonn %O A277015 0,2 %A A277015 _Antti Karttunen_, Oct 03 2016