Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130230
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130230 Primes p == 5 (mod 8) such that the Diophantine equation x^2 - p*y^2 = -4 has a solution in odd integers x, y. +0
2
5, 13, 29, 53, 61, 109, 149, 157, 173, 181, 229, 277, 293, 317, 397, 421, 461, 509, 541, 613, 653, 661, 733, 773, 797, 821, 853, 941, 1013, 1021, 1061, 1069, 1093, 1109, 1117, 1181, 1229, 1237, 1277, 1373, 1381, 1429, 1453, 1493, 1549, 1597 (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. A130229.

Sequence in context: A000328 A100438 A129371 this_sequence A106931 A078370 A005473

Adjacent sequences: A130227 A130228 A130229 this_sequence A130231 A130232 A130233

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research