Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054427
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A054427
%S A054427 1,2,4,3,8,5,16,7,6,9,32,17,64,15,13,12,10,33,128,14,11,65,256,31,25,
%T A054427 24,18,129,512,29,20,257,1024,63,30,28,49,48,21,19,34,513,2048,26,23,
%U A054427 1025,4096,127,61,57,27,97,96,22,40,36,66,2049,8192,62,56,41,35,4097
%N A054427 Permutation of natural numbers: maps the fractions A038567/A038566 to 
               the right side (n/m > 1) of Stern-Brocot tree.
%H A054427 <a href="Sindx_St.html#Stern">Index entries for sequences related to 
               Stern's sequences</a>
%H A054427 <a href="Sindx_Per.html#IntegerPermutation">Index entries for sequences 
               that are permutations of the natural numbers</a>
%F A054427 A038567_A038566_to_SternBrocot_permutation(100);
%e A054427 Right side of Stern-Brocot tree: 1/1 2/1 3/2 3/1 4/3 5/3 5/2 4/1 5/4 
               7/5 8/5 7/4 7/3 8/3 7/2 5/1
%e A054427 A038567/A038566: 1/1 2/1 3/1 3/2 4/1 4/3 5/1 5/2 5/3 5/4 6/1 6/5 7/1 
               7/2 7/3 7/4
%p A054427 A038567_A038566_to_SternBrocot_permutation := proc(u) local a,n,i; a 
               := []; for n from 1 to u do for i from 1 to n do if (1 = igcd(n,i)) 
               then a := [op(a),cfrac2binexp(convert((n/i),confrac))+1]; fi; od; 
               od; RETURN(a); end; # cfrac2binexp given in A054424.
%Y A054427 A038567/A038566[n]= shift_left(A007306)/A047679[A054427[n]]. Inverse 
               permutation: A054428.
%Y A054427 Sequence in context: A137622 A118783 A120242 this_sequence A048672 A127301 
               A122111
%Y A054427 Adjacent sequences: A054424 A054425 A054426 this_sequence A054428 A054429 
               A054430
%K A054427 nonn
%O A054427 1,2
%A A054427 Antti Karttunen

    
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