A336543 a(n) is the number of ways to write A336542(n) as a sum of two nonzero squares.
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, 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, 12, 16, 15, 5, 8, 18, 16, 14, 10, 10, 14, 15, 5, 20, 18, 16, 9, 11
Offset: 1
Keywords
Examples
a(11) = 3 as A336542 = 325 and can be written in three ways as a sum of two nonzero squares.
Links
- David A. Corneth, Table of n, a(n) for n = 1..10000