cp's OEIS Frontend

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.

A082523 Number of times k^2 + (n-k)^2 is a square for 1 <= k <= n-1.

This page as a plain text file.
%I A082523 #24 Sep 08 2022 08:45:10
%S A082523 0,0,0,0,0,2,0,0,0,0,0,0,2,0,0,2,0,0,0,2,0,2,0,0,0,0,2,0,0,2,0,0,2,2,
%T A082523 0,0,0,0,0,2,2,0,0,0,2,2,0,4,0,2,0,0,0,0,2,0,0,0,0,0,2,2,0,0,0,0,2,2,
%U A082523 2,2,0,2,0,0,0,2,0,2,0,0,2,0,2,2,0,0,0
%N A082523 Number of times k^2 + (n-k)^2 is a square for 1 <= k <= n-1.
%C A082523 a(n) is not zero for n = 7, 14, 17, 21, 23, 28, ... : A118905. - _Michel Marcus_, Jun 09 2013
%H A082523 Seiichi Manyama, <a href="/A082523/b082523.txt">Table of n, a(n) for n = 2..1000</a>
%t A082523 Table[Total[Boole[IntegerQ[Sqrt[#]]&/@Table[k^2+(n-k)^2,{k,n-1}]]],{n,2,90}] (* _Harvey P. Dale_, Aug 15 2017 *)
%o A082523 (PARI) a(n) = sum(k=1, n-1, issquare(k^2+(n-k)^2)) \\ _Michel Marcus_, Jun 09 2013
%o A082523 (Magma) [#[k:k in [1..n-1]|IsSquare(k^2+(n-k)^2)]:n in [2..90]]; // _Marius A. Burtea_, Jul 29 2019
%Y A082523 Cf. A118905.
%K A082523 nonn
%O A082523 2,6
%A A082523 CHAUVIN thierry (thierry.chauvin2(AT)wanadoo.fr), Apr 30 2003
%E A082523 Edited and extended by _Michel Marcus_, Jun 09 2013