login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A336543 a(n) is the number of ways to write A336542(n) as a sum of two nonzero squares. 1

%I

%S 0,1,1,1,1,2,2,2,2,2,3,2,3,4,3,4,4,3,4,4,6,3,5,5,6,3,5,6,8,4,8,6,6,8,

%T 8,9,4,6,7,10,9,4,12,7,8,8,10,12,12,4,7,9,8,12,12,5,16,8,9,16,13,10,

%U 12,16,15,5,8,18,16,14,10,10,14,15,5,20,18,16,9,11

%N a(n) is the number of ways to write A336542(n) as a sum of two nonzero squares.

%H David A. Corneth, <a href="/A336543/b336543.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A025426(A336542(n)). - _Michel Marcus_, Jul 31 2020

%e a(11) = 3 as A336542 = 325 and can be written in three ways as a sum of two nonzero squares.

%Y Cf. A025426, A274567.

%K nonn

%O 1,6

%A _David A. Corneth_, Jul 24 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 01:48 EDT 2021. Contains 348137 sequences. (Running on oeis4.)