Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130229
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130229 Primes p == 5 (mod 8) such that the Diophantine equation x^2 - p*y^2 = -4 has no solution in odd integers x, y. +0
2
37, 101, 197, 269, 349, 373, 389, 557, 677, 701, 709, 757, 829, 877, 997, 1213, 1301, 1613, 1861, 1901, 1949, 1973, 2069, 2221, 2269, 2341, 2357, 2621, 2797, 2837, 2917, 3109, 3181, 3301, 3413, 3709, 3797, 3821, 3853, 3877, 4013, 4021, 4093 (list; graph; listen)
OFFSET

1,1

COMMENT

For the Diophantine equation x^2 - p*y^2 = -4 to have a solution in odd integers x, y we must have p == 5 (mod 8)

Calculated using Dario Alpern's quadratic Diophantine solver at http://www.alpertron.com.ar/QUAD.HTM

Suggested by a discussion on the Number Theory Mailing List, circa Aug 01 2007.

CROSSREFS

Cf. A130230.

Sequence in context: A108160 A044224 A044605 this_sequence A142941 A105019 A090496

Adjacent sequences: A130226 A130227 A130228 this_sequence A130230 A130231 A130232

KEYWORD

nonn

AUTHOR

Warut Roonguthai (warut822(AT)gmail.com), Aug 06 2007

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research