login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088918 Number of representations of n as sum of two squares of distinct primes. 1

%I #7 Mar 30 2012 18:50:38

%S 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,1,0,0,0,0,1,

%T 0,0,0,0,0,0,0,0,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,

%U 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,0,0,0,0,0

%N Number of representations of n as sum of two squares of distinct primes.

%C a(n) <= A000161(n); a(A088909(n)) > 0;

%C a(A088919(n)) = n and a(k) <> n for k < A088919(n).

%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>

%e a(410)=2, see A088919.

%Y Cf. A002654.

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, Oct 23 2003

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 02:46 EDT 2024. Contains 371917 sequences. (Running on oeis4.)