Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A047896
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A047896
%S A047896 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,
%T A047896 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,
%U A047896 11,14,0,14,11,11,8,11,19,14,0,9,11,11,8,10,14,14,0,14,10,13,20,21
%N 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.
%C A047896 A form of generalized g.c.d. of 4 numbers.
%D A047896 N. J. A. Sloane and V. Vaishampayan, in preparation, 2001.
%e A047896 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.
%Y A047896 Cf. A059804, A059774.
%Y A047896 Sequence in context: A079087 A159956 A053839 this_sequence A073645 A082846 
               A117373
%Y A047896 Adjacent sequences: A047893 A047894 A047895 this_sequence A047897 A047898 
               A047899
%K A047896 nonn
%O A047896 1,3
%A A047896 N. J. A. Sloane (njas(AT)research.att.com) and Vinay Vaishampayan (vinay(AT)research.att.com), 
               Feb 27 2001

    
page 1

Search completed in 0.001 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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research