This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089296 Maximum prime required in the representation of the square of the n-th prime A000040(n) by a signed sum of squares of distinct other primes minimizing the largest prime used in the sum. 1
 29, 37, 19, 19, 19, 19, 19, 17, 19, 19, 19, 23, 29, 29, 29, 31, 37, 37, 37, 41, 41, 43, 43, 43, 47, 47, 53, 53, 53, 53, 59, 61, 61, 61, 67, 67, 67, 71, 71, 71, 73, 73, 79, 79, 79, 79, 83, 89, 89, 89, 89, 97, 97, 97, 101, 101, 101, 101, 103, 103, 103, 103, 107, 107, 109 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS T. Lassila, H. Pfoertner et al., Sum of unique prime squares? Thread in NG sci.math, Oct 21 2003. EXAMPLE a(1)=29: 2^2 = 4 = -29^2 + 19^2 + 17^2 + 11^2 + 7^2 + 5^2 a(2)=37: 3^2 = 9 = -37^2 + 23^2 + 19^2 + 17^2 + 11^2 + 7^2 + 5^2 + 2^2 a(3)=19: 5^2 = 25 = -19^2 + 17^2 + 13^2 - 11^2 + 7^2 a(4)=19: 7^2 = 49 = -19^2 + 17^2 + 11^2 CROSSREFS Cf. A089294 representation of n by distinct squares of primes, A089297 representation of (n-th prime)^2 with minimal number of terms. Sequence in context: A278329 A172413 A134254 * A089297 A250291 A127956 Adjacent sequences:  A089293 A089294 A089295 * A089297 A089298 A089299 KEYWORD nonn AUTHOR Hugo Pfoertner, Nov 18 2003 EXTENSIONS More terms from David Wasserman, Sep 01 2005 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 December 14 14:20 EST 2019. Contains 329979 sequences. (Running on oeis4.)