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

 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
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS David A. Corneth, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A025426(A336542(n)). - Michel Marcus, Jul 31 2020 EXAMPLE a(11) = 3 as A336542 = 325 and can be written in three ways as a sum of two nonzero squares. CROSSREFS Cf. A025426, A274567. Sequence in context: A286888 A257212 A001031 * A035250 A165054 A067743 Adjacent sequences:  A336540 A336541 A336542 * A336544 A336545 A336546 KEYWORD nonn AUTHOR David A. Corneth, Jul 24 2020 STATUS approved

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.

Last modified September 17 06:16 EDT 2021. Contains 347478 sequences. (Running on oeis4.)