This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089297 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 number of terms in the sum. 2

%I

%S 29,37,19,19,19,31,19,17,19,23,29,31,31,37,37,47,43,47,53,59,59,59,71,

%T 67,71,73,79,79,83,83,97,97,101,101,109,109,127,127,127,137,139,131,

%U 149,139,151,149,163,167,191,173,167,179,179,191,191,193,193,193,199,211

%N 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 number of terms in the sum.

%C a(1) requires 6 squares, a(2) requires 8, a(3) requires 5 and a(4) through a(70) require 3. - _David Wasserman_, Sep 01 2005

%H T. Lassila, H. Pfoertner et al., <a href="http://groups.google.com/group/sci.math/browse_thread/thread/78e4c851ebdb9280/d8a1aed3599aefe8">Sum of unique prime squares?</a> Thread in NG sci.math, Oct 21 2003.

%e The first representations different from those in A089296 are

%e a(6)=31: 13^2 = 169 = 31^2 - 29^2 + 7^2 = -31^2 + 29^2 + 17^2

%e a(10)=23: 29^2 = 841 = 23^2 + 19^2 - 7^2

%e a(11)=29: 31^2 = 961 = 29^2 + 13^2 - 7^2

%Y Cf. A088934 representation of n by distinct squares of primes, A089296 representation of (n-th prime)^2 with maximum term minimized.

%K nonn

%O 1,1

%A _Hugo Pfoertner_, Nov 18 2003

%E More terms from _David Wasserman_, Sep 01 2005

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 October 17 01:03 EDT 2019. Contains 328103 sequences. (Running on oeis4.)