|
Search: id:A099502
|
|
| |
|
| 3, 13, 20, 78, 85, 92, 99, 109, 136, 139, 143, 146, 150, 358, 402, 440, 457, 477, 501, 546, 549, 583, 611, 638, 655, 665, 696, 730, 754, 778, 812, 887, 904, 966, 979, 996, 1034, 1051, 2089, 2161, 2427, 2458, 2499, 2697, 2751, 2813, 2840, 2912, 2922, 2929
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Granville and Selfridge discuss the numbers n+1 in their paper. For each of these n<10000, Scott Contini found three integers between n^2 and (n+1)^2 such that their product is twice a square. There are 123 instances of n < 10000; 215 instances for n < 20000.
|
|
LINKS
|
Andrew Granville and John Selfridge, Product of integers in an interval, modulo squares (pdf), Electronic Journal of Combinatorics, Volume 8(1), 2001.
|
|
EXAMPLE
|
13 is here because {171,180,190} is the smallest set of integers in the interval [170,195] whose product is twice a square.
|
|
CROSSREFS
|
Cf. A099500 (number of subsets), A099501 (size of the subset having the least number of integers).
Sequence in context: A018621 A024469 A055202 this_sequence A055059 A050903 A117766
Adjacent sequences: A099499 A099500 A099501 this_sequence A099503 A099504 A099505
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), Oct 20 2004
|
|
|
Search completed in 0.002 seconds
|
