Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059804
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059804 Consider the line segment in R^n from the origin to the point v=(2,3,5,7,11,...) with prime coordinates; let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times v.v. +0
5
1, 3, 9, 39, 87, 215, 391, 711, 1326, 1975, 2925, 4256, 5696, 7537, 9774, 12488, 16322, 20477, 24966, 30007, 35336, 41577, 48466, 56387, 65796, 75997, 86606, 98055, 109936, 122705, 138834, 155995, 174764, 194085, 216286, 239087, 263736, 290305 (list; graph; listen)
OFFSET

2,2

COMMENT

v.v is given by A024450(n). For n >= 19, a(n) = A024450(n-1).

Officially these are just conjectures so far.

REFERENCES

N. J. A. Sloane and V. Vaishampayan, in preparation, 2001.

CROSSREFS

Cf. A059774, A024450, A047896, A060453.

Cf. A137609 (where the minimum distance occurs along the line segment).

Sequence in context: A030846 A030818 A020121 this_sequence A065657 A149026 A149027

Adjacent sequences: A059801 A059802 A059803 this_sequence A059805 A059806 A059807

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com) and Vinay Vaishampayan (vinay(AT)research.att.com), Feb 21, 2001

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research