|
Search: id:A055096
|
|
|
| A055096 |
|
Triangle of sums of 2 distinct nonzero squares: (1^2+2^2), (1^2+3^2), (2^2+3^2), (1^2+4^2), (2^2+4^2), (3^2+4^2), ... |
|
+0
13
|
|
| 5, 10, 13, 17, 20, 25, 26, 29, 34, 41, 37, 40, 45, 52, 61, 50, 53, 58, 65, 74, 85, 65, 68, 73, 80, 89, 100, 113, 82, 85, 90, 97, 106, 117, 130, 145, 101, 104, 109, 116, 125, 136, 149, 164, 181, 122, 125, 130, 137, 146, 157, 170, 185, 202, 221, 145, 148, 153, 160
(list; table; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Discovered by Bernard Frenicle de Bessy (1605?-1675). - Paul Curtz (bpcrtz(AT)free.fr), Aug 18 2008
|
|
REFERENCES
|
(Bernard) de? Frenicle (de Bessy), studying Pythagorean triangles: Methode pour trouver ...; in Divers ouvrages de mathematique et de physique par Messieurs de l'Academie Royale des Sciences, In-folio, (4)+6+519 pages, Paris, 1693. - Paul Curtz (bpcrtz(AT)free.fr), Aug 18 2008
|
|
LINKS
|
A. Karttunen, Larger table, showing also locations of 4k+1 primes and squares
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Index entries for sequences related to sums of squares
|
|
FORMULA
|
a(n) = sum2distinct_squares_array(n)
|
|
MAPLE
|
sum2distinct_squares_array := (n) -> (((n-((trinv(n-1)*(trinv(n-1)-1))/2))^2)+((trinv(n-1)+1)^2));
|
|
CROSSREFS
|
Sorting gives A024507. Count of divisors: A055097, Moebius: A055132. For trinv, follow A055088. Left edge: A002522. Right edge: A001844. Central column: A033429.
Adjacent sequences: A055093 A055094 A055095 this_sequence A055097 A055098 A055099
Sequence in context: A024507 A004431 A025302 this_sequence A132777 A134961 A053029
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Antti Karttunen Apr 04 2000
|
|
|
Search completed in 0.002 seconds
|
