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 A176845 #11 Feb 06 2019 02:30:38
%S A176845 1,2,3,4,5,6,8,9,10,12,13,14,16,18,19,20,22,24,25,26,28,30,32,33,34,
%T A176845 36,38,39,40,42,44,46,48,50,51,52,54,55,56,58,60,62,64,65,66,68,69,70,
%U A176845 72,74,76,78,80,81,82,84,85,86,88,89,90,92,94,96,97,98,100,102,103,104,106
%N A176845 Numbers k such that A147846(k) + A147846(k+1) is a square.
%C A176845 Does the sequence contain all even numbers? - _Giovanni Teofilatto_, Apr 29 2010
%p A176845 From _R. J. Mathar_, Apr 30 2010: (Start)
%p A176845 A127949 := proc(n) if issqr(1+8*n) then (sqrt(1+8*n)-1)/2 ; else -1 ; end if; end proc:
%p A176845 A147846 := proc(n) option remember ; local k,a ; if n = 1 then 1; else for a from procname(n-1)+1 do k := A127949(a) ; if k > 0 then if isprime(k) or isprime(k+1) then return a; end if; end if; end do; end if; end proc:
%p A176845 isA176845 := proc(n) issqr( A147846(n)+A147846(n+1)) ; end proc:
%p A176845 for n from 1 to 400 do if isA176845(n) then printf("%d,",n) ; end if; end do; (End)
%Y A176845 Cf. A147846.
%K A176845 nonn
%O A176845 1,2
%A A176845 _Giovanni Teofilatto_, Apr 27 2010
%E A176845 Corrected (7 replaced by 8) and extended by _R. J. Mathar_, Apr 30 2010