Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060130
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A060130
%S A060130 0,1,1,2,1,2,1,2,2,3,2,3,1,2,2,3,2,3,1,2,2,3,2,3,1,2,2,3,2,3,2,3,3,4,3,
%T A060130 4,2,3,3,4,3,4,2,3,3,4,3,4,1,2,2,3,2,3,2,3,3,4,3,4,2,3,3,4,3,4,2,3,3,4,
%U A060130 3,4,1,2,2,3,2,3,2,3,3,4,3,4,2,3,3,4,3,4,2,3,3,4,3,4,1,2,2,3,2,3,2,3,3
%N A060130 Minimum number of transpositions needed to compose each permutation in 
               the lists A060117/A060118; number of nonzero digits in factorial 
               base representation (A007623) of n.
%F A060130 a(n) = count_nonfixed(convert(PermUnrank3R(n), 'disjcyc'))-nops(convert(PermUnrank3R(n), 
               'disjcyc')) or nops(fac_base(n))-nops(positions(0, fac_base(n)))
%Y A060130 A060130[n] = A060129[n] - A060128[n]. Cf. A055091, A060131.
%Y A060130 Sequence in context: A082498 A112223 A132881 this_sequence A008682 A112224 
               A058774
%Y A060130 Adjacent sequences: A060127 A060128 A060129 this_sequence A060131 A060132 
               A060133
%K A060130 nonn
%O A060130 0,4
%A A060130 Antti Karttunen Mar 02 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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research