Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139365
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A139365 Array of digit sums of factorial representation of numbers 0,1,...,n!-1 for n>=1. +0
1
0, 0, 0, 1, 0, 1, 1, 2, 2, 3, 0, 1, 1, 2, 2, 3, 1, 2, 2, 3, 3, 4, 2, 3, 3, 4, 4, 5, 3, 4, 4, 5, 5, 6, 0, 1, 1, 2, 2, 3, 1, 2, 2, 3, 3, 4, 2, 3, 3, 4, 4, 5, 3, 4, 4, 5, 5, 6, 1, 2, 2, 3, 3, 4, 2, 3, 3, 4, 4, 5, 3, 4, 4, 5, 5, 6, 4, 5, 5, 6, 6, 7, 2, 3, 3, 4, 4, 5, 3, 4, 4, 5, 5, 6, 4, 5, 5, 6, 6, 7, 5, 6, 6, 7, 7 (list; graph; listen)
OFFSET

0,8

COMMENT

The row lengths sequence is A000142 (factorials).

When the factorial representation is read as (D.N.) Lehmer code for permutations of n objects then the digit sums in row n count the number of inversions of the permutations arranged in lexicographic order.

Row n is the first n! terms of A034968. [From Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), May 13 2009]

REFERENCES

D. N. Lehmer, On the orderly listing of substitutions, Bull. AMS 12 (1906) 81-84.

LINKS

A. Kohnert, Kombinatorische Algorithmen in C, Skript, Uni Bayreuth, 1997, pp. 5-7

W. Lang, First 6 rows. Factorial representations or Lehmer code for permutations.

FORMULA

Row n>=1: sum(facrep(n,m)[n-j],j=1..n), m=0,1,...,n!-1, with the factorial representation facrep(n,m) of m for given n.

EXAMPLE

n=3: The Lehmer codes for the permutations of {1,2,3} are [0,0,0], [0,1,0], [1,0,0], [1,1,0], [2,0,0] and [2,1,0]. These are the factorial representations for 0,1,...,5=3!-1. Therefore row n=3 has the digit sums 0,1,1,2,2,3, the number of inversions of the permutations [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2] and [3,2,1] (lexicographic order).

CROSSREFS

Cf. A034968. [From Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), May 13 2009]

Sequence in context: A079243 A073438 A160115 this_sequence A071479 A091426 A053761

Adjacent sequences: A139362 A139363 A139364 this_sequence A139366 A139367 A139368

KEYWORD

nonn,easy,tabf

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de) May 21 2008

EXTENSIONS

In %H '.' -> 'or','with' -> 'for' In %D changed http link address. - Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de), Sep 09 2008

Zero term added by Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), May 13 2009

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 9 18:50 EST 2009. Contains 170568 sequences.


AT&T Labs Research