|
%I #20 Dec 06 2015 22:39:34
%S 2,29,89,101,281,269,641,461,701,761,1049,941,1109,1601,1361,2621,
%T 2309,1889,2441,2141,2609,3929,3701,3461,3449,5849,4241,4289,5081,
%U 8669,7589,5381,6569,9941,8861,7229,7829,8501,8069,8609,9749,10601
%N Smallest prime with exactly n representations as sum of 3 distinct positive squares.
%C 2 cannot be represented as the sum of 3 distinct positive squares hence a(0)=2 (and offset is 0).
%H Zak Seidov, <a href="/A242675/b242675.txt">Table of n, a(n) for n = 0..1000</a>
%e 29 = 2^2 + 3^2 + 4^2 and this is the only such representation.
%e 89 = 2^2 + 6^2 + 7^2 = 3^2 + 4^2 + 8^2 and these are the only such representations.
%e 101 = 1^2 + 6^2 + 8^2 = 2^2 + 4^2 + 9^2 = 4^2 + 6^2 + 7^2 and these are the only such representations.
%Y Cf. A004432, A125516.
%K nonn,look
%O 0,1
%A _Zak Seidov_, May 20 2014
|
