cp's OEIS Frontend

A063014 Number of solutions to n^2 = b^2 + c^2 (with c >= b >= 0).

%I A063014 #50 Jun 02 2024 14:33:00
%S A063014 1,1,1,1,1,2,1,1,1,1,2,1,1,2,1,2,1,2,1,1,2,1,1,1,1,3,2,1,1,2,2,1,1,1,
%T A063014 2,2,1,2,1,2,2,2,1,1,1,2,1,1,1,1,3,2,2,2,1,2,1,1,2,1,2,2,1,1,1,5,1,1,
%U A063014 2,1,2,1,1,2,2,3,1,1,2,1,2,1,2,1,1,5,1,2,1,2,2,2,1,1,1,2,1,2,1,1,3,2,2
%N A063014 Number of solutions to n^2 = b^2 + c^2 (with c >= b >= 0).
%H A063014 Felix Huber, <a href="/A063014/b063014.txt">Table of n, a(n) for n = 0..10000</a>
%H A063014 Michael Gilleland, <a href="/selfsimilar.html">Some Self-Similar Integer Sequences</a>
%F A063014 a(0) = 1; a(n) = A046080(n) + 1 for n > 0. [amended by _Georg Fischer_, Jan 25 2020]
%F A063014 a(n) = A000161(n^2). - _Christian Krause_, Dec 08 2022
%e A063014 a(0)=1 since 0^2 = 0^2 + 0^2;
%e A063014 a(5)=2 since 5^2 = 0^2 + 5^2 = 3^2 + 4^2;
%e A063014 a(25)=3 since 25^2 = 0^2 + 25^2 = 7^2 + 24^2 = 15^2 + 20^2.
%p A063014 with(NumberTheory):
%p A063014 A063014 := n -> nops(SumOfSquares(n^2));
%p A063014 seq(A063014(n), n = 0 .. 100); # _Felix Huber_, Jun 01 2024
%Y A063014 Cf. A000161, A046080.
%Y A063014 Column k=2 of A255212.
%K A063014 nonn
%O A063014 0,6
%A A063014 _Henry Bottomley_, Jul 26 2001