login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047896 For given n, consider all 4-tuples P = (a,b,c,d) with P.P = n; let d = squared distance to the line OP from the closest point of Z^n (excluding the endpoints); sequence gives max_P d*n. 2
1, 1, 2, 3, 1, 2, 3, 0, 2, 4, 2, 3, 3, 3, 5, 0, 2, 5, 3, 4, 5, 6, 5, 0, 6, 4, 5, 3, 5, 9, 6, 0, 6, 8, 6, 8, 9, 8, 9, 0, 5, 6, 5, 8, 9, 11, 10, 0, 6, 11, 9, 4, 10, 11, 10, 0, 14, 9, 11, 11, 9, 11, 14, 0, 14, 11, 11, 8, 11, 19, 14, 0, 9, 11, 11, 8, 10, 14, 14, 0, 14, 10, 13, 20, 21 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

A form of generalized g.c.d. of 4 numbers.

REFERENCES

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

EXAMPLE

n=10, best P is (1,1,2,2), closest point of Z^4 to OP is (0,0,1,1) at squared distance d = 2/5, so a(10) = 10*2/5 = 4.

CROSSREFS

Cf. A059804, A059774.

Sequence in context: A205003 A159956 A053839 * A073645 A179542 A082846

Adjacent sequences:  A047893 A047894 A047895 * A047897 A047898 A047899

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 20:38 EST 2012. Contains 205663 sequences.