|
%I #21 Dec 30 2015 13:43:18
%S 0,121,144,113569,123904,398161,399424,1708249,1710864,24591681,
%T 24681024,53890281,53934336,184063489,184742464,8338063969,8339342400,
%U 470959650225,470972003076,25876358308161,25876429524544,168967735540081,168967969517824,303965800198225
%N Squares present in A259934.
%C Every other term is even and every other odd. From each odd square starts a new run of odd terms in A259934 (see A262516 for the lengths of these and A262517 for the odd terms themselves), which lasts as long as the next even square is encountered, at which point the parity of terms is switched back to even.
%C The terms were grepped from the data file of A259934 provided by _Max Alekseyev_, which contained terms up to A259934(397420670) = 9999999974.
%C The indexing starts from zero, because a(0) = 0 is a special case in this sequence.
%C a(31) > 10^16. - _Hiroaki Yamanouchi_, Oct 07 2015
%H Hiroaki Yamanouchi, <a href="/A262514/b262514.txt">Table of n, a(n) for n = 0..30</a>
%F a(n) = A259934(A263276(n)).
%Y Cf. A262515 (square roots of these terms), A262516, A262517, A259934.
%K nonn
%O 0,2
%A _Antti Karttunen_, Sep 26 2015
%E a(17)-a(30) from _Hiroaki Yamanouchi_, Oct 07 2015
|
