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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036918 Floor(e*(n-1)*(n-1)!)). 2
0, 2, 10, 48, 260, 1630, 11742, 95900, 876808, 8877690, 98641010, 1193556232, 15624736140, 220048367318, 3317652307270, 53319412081140, 909984632851472, 16436597430879730, 313262209859119578, 6282647653285676000 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Also the number of positive integers with all distinct digits expressed in base n. E.g. a(10)=Sum[A073531(j); j=1...10]. - Labos E. (labos(AT)ana.sote.hu), Dec 05 2002

EXAMPLE

If base=3, then 10 all-distinct numbers exist: {1,2,12,21,123,132,213,231,312,321} so a(3)=10.

MATHEMATICA

Table[Apply[Plus, Table[((b-1)/b)*Binomial[b, j]*j!, {j, 1, b}]], {b, 1, 25}]

CROSSREFS

Cf. A073531, A073532.

a(n) = A001339(n)-1.

Equals (n-1) * A000522(n-1).

Sequence in context: A114693 A121950 A086853 * A200540 A166922 A129118

Adjacent sequences:  A036915 A036916 A036917 * A036919 A036920 A036921

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 16 17:48 EST 2012. Contains 205939 sequences.