This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A045698 Number of ways n can be written as sum of two prime squares. 6
 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS a(A214879(n)) = 0; a(A045636(n)) > 0; a(A214723(n)) = 1; a(A214511(n)) = n and a(m) < n for m < A214511(n). - Reinhard Zumkeller, Jul 29 2012 LINKS _Reinhard Zumkeller_, Table of n, a(n) for n = 0..10000 FORMULA For example a(29) = 1 because 29=2^2+5^2. a(3)=0 because there is no way to write 3 as sum of two squares of primes. PROG (Haskell) a045698 n = length \$ filter (\x -> x > 0 && a010051' x == 1) \$                             map (a037213 . (n -)) \$                                 takeWhile (<= div n 2) a001248_list -- Reinhard Zumkeller, Jul 29 2012 CROSSREFS Cf. A010051, A001248, A037213. Sequence in context: A037824 A025461 A169674 * A106197 A011722 A044938 Adjacent sequences:  A045695 A045696 A045697 * A045699 A045700 A045701 KEYWORD easy,nonn,changed AUTHOR EXTENSIONS More terms from Erich Friedman. STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .