cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A344050 a(n) = Sum_{k=0..n} (-1)^(n-k)*binomial(n, k)*|Lah(n, k)|. Inverse binomial convolution of the unsigned Lah numbers A271703.

This page as a plain text file.
%I A344050 #7 May 10 2021 07:38:32
%S A344050 1,1,-3,1,73,-699,3001,24697,-783999,10946233,-80958779,-656003919,
%T A344050 40097528857,-944102982419,14449693290033,-81180376526759,
%U A344050 -4110744092532479,203618771909117937,-5868277577182238579,117997016943575159713,-1055340561026036009559,-45279878749358024400299
%N A344050 a(n) = Sum_{k=0..n} (-1)^(n-k)*binomial(n, k)*|Lah(n, k)|. Inverse binomial convolution of the unsigned Lah numbers A271703.
%F A344050 a(n) = (-1)^(n-1)*n*n!*hypergeom([1 - n, 1 - n], [2, 2], -1) for n >= 1.
%p A344050 aList := proc(len) local lah;
%p A344050 lah := (n, k) -> `if`(n = k, 1, binomial(n-1, k-1)*n!/k!):
%p A344050 seq(add((-1)^(n-k)*binomial(n, k)*lah(n, k), k = 0..n), n = 0..len-1) end:
%p A344050 print( aList(22) );
%t A344050 a[n_] := (-1)^(n-1) n n! HypergeometricPFQ[{1 - n, 1 - n}, {2, 2}, -1]; a[0] := 1;
%t A344050 Table[a[n], {n, 0, 20}]
%Y A344050 Cf. A271703, A111596, A344050.
%K A344050 sign
%O A344050 0,3
%A A344050 _Peter Luschny_, May 10 2021