|
Search: id:A012132
|
|
|
| A012132 |
|
Numbers z such x(x+1)+y(y+1)=z(z+1) is solvable. |
|
+0
5
|
|
| 3, 6, 8, 10, 11, 13, 15, 16, 18, 20, 21, 23, 26, 27, 28, 31, 33, 36, 37, 38, 40, 41, 43, 44, 45, 46, 48, 49, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 62, 63, 64, 66, 67, 68, 71, 73, 74, 75, 76, 77, 78, 80, 81, 83, 86, 88, 89, 91, 92, 93
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
For n>1, A047219 is a subset of this sequence. This is because n^2+(n+1)^2 is divisible by 5 if n is (1 or 3) mod 5 (also see A027861). - Dmitry Kamenetsky (dkamen(AT)rsise.anu.edu.au), Sep 02 2008
|
|
REFERENCES
|
H. Finner and K. Strassburger, Increasing sample sizes do not necessarily increase the power of UMPU-tests for 2 X 2-tables. Metrika, 54, 77-91, (2001).
Aviezri S. Fraenkel, Diophantine equations involving generalized triangular and tetrahedral numbers, pp. 99-114 of A. O. L. Atkin and B. J. Birch, editors, Computers in Number Theory. Academic Press, NY, 1971.
H. Harborth, Fermat-like binomial equations, Applications of Fibonacci numbers, Proc. 2nd Int. Conf., San Jose/Ca., August 1986, 1-5 (1988).
|
|
CROSSREFS
|
Complement of A027861 - Michael Somos, Jun 08, 2000.
Cf. A047219, A027861.
Sequence in context: A072960 A159264 A055073 this_sequence A108769 A112234 A023983
Adjacent sequences: A012129 A012130 A012131 this_sequence A012133 A012134 A012135
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
sander(AT)win.tue.nl (Sander van Rijnswou)
|
|
EXTENSIONS
|
More terms and references from Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Feb 09 2000
|
|
|
Search completed in 0.002 seconds
|
