Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067069
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067069 Numbers n such that for every k the following condition holds: (*) The number of nonnegative solutions of the Diophantine equation x^2 + n*y^2 = 1+n*k^2 equals one half of the number of divisors of 1+n*k^2 if 1+n*k^2 is not a square and one half of 1 + the number of divisors of 1+n*k^2 if 1+n*k^2 is a square. +0
1
2, 3, 4, 6, 8, 10, 12, 16, 18, 22, 24, 28, 30, 40, 42, 48, 58, 60, 70, 72, 78, 88, 102, 112, 120, 130, 168, 190, 210, 232, 240, 280, 312, 330, 408, 462, 520, 760, 840, 1320, 1848 (list; graph; listen)
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 December 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research