The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A223173 Poly-Cauchy numbers c_3^(-n). 2
-1, -3, -1, 45, 359, 2037, 10079, 46365, 204119, 873477, 3666959, 15191085, 62342279, 254119317, 1030760639, 4165958205, 16792710839, 67557739557, 271392171119, 1089053371725, 4366669645799, 17498051254197, 70086331418399, 280627721655645 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Definition of poly-Cauchy numbers in A222627.
LINKS
Takao Komatsu, Poly-Cauchy numbers with a q parameter, Ramanujan J. 31 (2013), 353-371.
Takao Komatsu, Poly-Cauchy numbers, Kyushu J. Math. 67 (2013), 143-153.
M. Z. Spivey, Combinatorial sums and finite differences, Discr. Math. 307 (24) (2007) 3130-3146
FORMULA
a(n) = Sum_{k=0..3} Stirling1(3,k)*(k+1)^n.
From Colin Barker, Mar 31 2013: (Start)
Conjecture:
a(n) = 2^(1+n) - 3^(1+n) + 4^n;
g.f.: -x*(6*x-1) / ((2*x-1)*(3*x-1)*(4*x-1)). (End)
Conjecture verified by Robert Israel, Jun 21 2018
MAPLE
seq(2^(n+1)-3^(n+1)+4^n, n=0..30); # Robert Israel, Jun 21 2018
MATHEMATICA
Table[Sum[StirlingS1[3, k] (k + 1)^n, {k, 0, 3}], {n, 25}]
PROG
(Magma) [&+[StirlingFirst(3, k)*(k+1)^n: k in [0..3]]: n in [1..25]]; // Bruno Berselli, Mar 28 2013
(PARI) a(n) = sum(k=0, 3, stirling(3, k, 1)*(k+1)^n); \\ Michel Marcus, Nov 14 2015
CROSSREFS
Sequence in context: A158958 A098341 A354391 * A010292 A369756 A133104
KEYWORD
sign
AUTHOR
Takao Komatsu, Mar 28 2013
STATUS
approved

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 June 8 03:54 EDT 2024. Contains 373207 sequences. (Running on oeis4.)