Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111177
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111177 Number of base n numbers in which each digit appears only once (all unnecessary 0's deleted). +0
1
4, 21, 130, 913, 7176, 62629, 602806, 6356865, 72994348, 907497301, 12152572554, 174476220241, 2674434002800, 43603430324133, 753581024080126, 13763517571878529, 264919276238885076, 5360264479811601685 (list; graph; listen)
OFFSET

2,1

FORMULA

a(n)=Sum(i=0, n-1) (i^2+i+1)(n-1)!/(n-1-i)!; n>1

EXAMPLE

a(2)=4 because in the binary system only the numbers 0;1;0,1;10 can be written with each digit used only once (all unnecessary 0's deleted).

MATHEMATICA

f[n_] := Sum[(i^2 + i + 1)(n - 1)!/(n - 1 - i)!, {i, 0, n - 1}]; Table[ f[n], {n, 2, 19}] (* Robert G. Wilson v *)

CROSSREFS

Adjacent sequences: A111174 A111175 A111176 this_sequence A111178 A111179 A111180

Sequence in context: A032326 A007345 A099250 this_sequence A141052 A058308 A078591

KEYWORD

nonn

AUTHOR

Rafael Hofman (mathematics287(AT)yahoo.de), Oct 22 2005

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Oct 29 2005

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 January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research