login
This site is supported by donations 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
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..81.

EXAMPLE

See example in A088910.

CROSSREFS

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.

Sequence in context: A306384 A196188 A089294 * A177923 A155848 A088399

Adjacent sequences:  A088931 A088932 A088933 * A088935 A088936 A088937

KEYWORD

nonn

AUTHOR

Hugo Pfoertner, Nov 06 2003

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 20 18:56 EDT 2019. Contains 326154 sequences. (Running on oeis4.)