A242675 Smallest prime with exactly n representations as sum of 3 distinct positive squares.

2, 29, 89, 101, 281, 269, 641, 461, 701, 761, 1049, 941, 1109, 1601, 1361, 2621, 2309, 1889, 2441, 2141, 2609, 3929, 3701, 3461, 3449, 5849, 4241, 4289, 5081, 8669, 7589, 5381, 6569, 9941, 8861, 7229, 7829, 8501, 8069, 8609, 9749, 10601

Offset: 0

Author

Zak Seidov, May 20 2014

Keywords

• nonn
• look

Comments

2 cannot be represented as the sum of 3 distinct positive squares hence a(0)=2 (and offset is 0).

Examples

			29 = 2^2 + 3^2 + 4^2 and this is the only such representation.
89 = 2^2 + 6^2 + 7^2 = 3^2 + 4^2 + 8^2 and these are the only such representations.
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.
		

Links

• Zak Seidov, Table of n, a(n) for n = 0..1000

Crossrefs

Cf. A004432, A125516.