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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A354018 Expansion of e.g.f. -log(1-x)/(1 + log(1-x) - log(1-x)^2) 2
0, 1, 3, 20, 172, 1864, 24248, 368136, 6388128, 124711944, 2705241672, 64550432352, 1680280323984, 47383464508080, 1438986494794704, 46821994627363968, 1625069178022566528, 59927028756823323648, 2339899614887520358656, 96439023491479275172608 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..19.

FORMULA

a(n) = Sum_{k=0..n} k! * Fibonacci(k) * |Stirling1(n,k)|.

a(n) ~ n! * (sqrt(5) - 1) / (2 * sqrt(5) * exp((sqrt(5) - 1)/2) * (1 - exp((1 - sqrt(5))/2))^(n+1)). - Vaclav Kotesovec, May 15 2022

MATHEMATICA

Table[Sum[k! * Fibonacci[k] * Abs[StirlingS1[n, k]], {k, 0, n}], {n, 0, 20}] (* Vaclav Kotesovec, May 15 2022 *)

PROG

(PARI) my(N=20, x='x+O('x^N)); concat(0, Vec(serlaplace(-log(1-x)/(1+log(1-x)-log(1-x)^2))))

(PARI) a(n) = sum(k=0, n, k!*fibonacci(k)*abs(stirling(n, k, 1)));

CROSSREFS

Cf. A000045, A005444, A005445, A265165, A320352, A354013.

Sequence in context: A213377 A357094 A216583 * A154644 A321276 A000891

Adjacent sequences: A354015 A354016 A354017 * A354019 A354020 A354021

KEYWORD

nonn

AUTHOR

Seiichi Manyama, May 14 2022

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 December 7 08:58 EST 2022. Contains 358653 sequences. (Running on oeis4.)