Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056203
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056203 Triangle of numbers related to congruum problem: T(n,k)=n^2+2nk-k^2 with n>k>0, starting at T(2,1)=7. +0
2
7, 14, 17, 23, 28, 31, 34, 41, 46, 49, 47, 56, 63, 68, 71, 62, 73, 82, 89, 94, 97, 79, 92, 103, 112, 119, 124, 127, 98, 113, 126, 137, 146, 153, 158, 161, 119, 136, 151, 164, 175, 184, 191, 196, 199, 142, 161, 178, 193, 206, 217, 226, 233, 238, 241, 167, 188 (list; table; graph; listen)
OFFSET

1,1

COMMENT

The congruum problem is to find h (A057103) such that there are integers x (A055096), y (A057105) and z (A056203) with h=x^2-y^2=z^2-x^2.

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

FORMULA

a(n) = sqrt(A057103(n)+A055096(n)^2) = sqrt(2*A057103(n)+A057105(n)^2).

EXAMPLE

a(1) = T(2,1) = 2^2+2*2*1-1 = 7.

CROSSREFS

Cf. A057102.

Sequence in context: A100599 A118905 A092433 this_sequence A025021 A131439 A102041

Adjacent sequences: A056200 A056201 A056202 this_sequence A056204 A056205 A056206

KEYWORD

nonn,tabl

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Aug 02 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research