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!)
A088934 Maximum prime required for the representation of n by a signed sum of squares of distinct primes that has the minimal number of terms A088910(n). 3

%I #2 Mar 31 2012 10:29:03

%S 19,13,19,13,2,3,13,19,13,3,13,7,5,3,13,7,5,13,13,7,5,5,19,13,7,5,13,

%T 13,7,5,5,19,13,7,5,13,7,7,5,13,7,17,11,11,7,7,17,11,13,7,17,11,13,7,

%U 7,17,11,13,7,11,11,7,7,11,13,7,17,11,11,7,7,17,11,13,7,17,11,11,7,7,17,11

%N Maximum prime required for the representation of n by a signed sum of squares of distinct primes that has the minimal number of terms A088910(n).

%e See example in A088910.

%Y Cf. A089294 representation minimizing the maximum occurring prime instead of minimizing the number of terms, A089297 representation of the squares of primes by squares of distinct other primes.

%K nonn

%O 0,1

%A _Hugo Pfoertner_, Nov 06 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 23 12:44 EDT 2024. Contains 371913 sequences. (Running on oeis4.)