This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A242675 Smallest prime with exactly n representations as sum of 3 distinct positive squares. 1
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS 2 cannot be represented as the sum of 3 distinct positive squares hence a(0)=2 (and offset is 0). LINKS Zak Seidov, Table of n, a(n) for n = 0..1000 EXAMPLE 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. CROSSREFS Cf. A004432, A125516. Sequence in context: A031918 A101231 A141949 * A253305 A123004 A062618 Adjacent sequences:  A242672 A242673 A242674 * A242676 A242677 A242678 KEYWORD nonn,look AUTHOR Zak Seidov, May 20 2014 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 October 15 22:25 EDT 2019. Contains 328038 sequences. (Running on oeis4.)