Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086719
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086719 Numbers n == 1, 2, 5 or 6 (mod 8) such that there is only one solution to i^2+j^2+k^2=n, i >= j >= k >= 0. +0
2
1, 2, 5, 6, 10, 13, 14, 21, 22, 30, 37, 42, 46, 58, 70, 78, 93, 133, 142, 190, 253 (list; graph; listen)
OFFSET

1,2

REFERENCES

P. T. Bateman and E. Grosswald, Positive integers expressible as a sum of three squares in essentially only one way, J. Number Theory, 19 (1984), 301-308.

CROSSREFS

Cf. A085616.

Sequence in context: A089269 A047440 A007674 this_sequence A115200 A075823 A102212

Adjacent sequences: A086716 A086717 A086718 this_sequence A086720 A086721 A086722

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jul 31 2003

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research