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