login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324359 Total number of occurrences of 9 in the (signed) displacement sets of all permutations of [n+9] divided by 9!. 3

%I #14 Sep 08 2022 08:46:24

%S 0,1,19,301,4659,73651,1208849,20736801,372683159,7020426511,

%T 138543438429,2861318625661,61767341913539,1391789835244251,

%U 32689488282841529,799220290375798681,20312800343333343279,535995638431063608871,14665906835087251866389

%N Total number of occurrences of 9 in the (signed) displacement sets of all permutations of [n+9] divided by 9!.

%H Alois P. Heinz, <a href="/A324359/b324359.txt">Table of n, a(n) for n = 0..443</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation">Permutation</a>

%F E.g.f.: (1-exp(-x))/(1-x)^10.

%F a(n) = -1/9! * Sum_{j=1..n} (-1)^j * binomial(n,j) * (n+9-j)!.

%F a(n) = A306234(n+9,9).

%p a:= n-> (k-> -add((-1)^j*binomial(n, j)*(n+k-j)!, j=1..n)/k!)(9):

%p seq(a(n), n=0..23);

%t Range[0, 20]! CoefficientList[Series[(1 - Exp[-x])/(1 - x)^10, {x, 0, 20}], x] (* _Vincenzo Librandi_, Jun 06 2019 *)

%o (Magma) [0] cat [(-1/Factorial(9)) * &+[(-1)^j * Binomial(n,j) * Factorial(n+9-j) : j in [1..n]]: n in [1..20]]; // _Vincenzo Librandi_, Jun 06 2019

%Y Column k=9 of A324362.

%Y Cf. A306234.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Feb 23 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 15 11:07 EDT 2024. Contains 375173 sequences. (Running on oeis4.)