A349450 Dirichlet inverse of right-shifted Catalan numbers [as when started from A000108(0): 1, 1, 2, 5, 14, 42, etc.]

1, -1, -2, -4, -14, -38, -132, -420, -1426, -4834, -16796, -58688, -208012, -742636, -2674384, -9693976, -35357670, -129641774, -477638700, -1767253368, -6564119892, -24466233428, -91482563640, -343059494120, -1289904147128, -4861945985428, -18367353066440, -69533549429280, -263747951750360, -1002242211282032

Offset

1,3

Links

Antti Karttunen, Table of n, a(n) for n = 1..1001

Formula

a(1) = 1; a(n) = -Sum_{d|n, d < n} A000108((n/d)-1) * a(d).

For n > 1, a(n) = -A035010(n) = A035102(n) - A000108(n-1).

G.f. A(x) satisfies: A(x) = x - Sum_{k>=2} Catalan(k-1) * A(x^k). - Ilya Gutkovskiy, Feb 23 2022

x = Sum_{n>=1} a(n) * C(x^n) where C(x) = (1 - sqrt(1-4*x))/2 is the g.f. of the Catalan numbers (A000108). - Paul D. Hanna, Nov 27 2024

Mathematica

a[1] = 1; a[n_] := a[n] = -DivisorSum[n, a[#] * CatalanNumber[n/# - 1] &, # < n &]; Array[a, 30] (* Amiram Eldar, Nov 22 2021 *)

Prog

(PARI)
A000108(n) = binomial(2*n, n)/(n+1);
memoA349450 = Map();
A349450(n) = if(1==n, 1, my(v); if(mapisdefined(memoA349450, n, &v), v, v = -sumdiv(n, d, if(d<n, A000108((n/d)-1)*A349450(d), 0)); mapput(memoA349450, n, v); (v)));

Crossrefs

Cf. A000108, A035010, A035102.

Cf. also A349449, A349451, A349452, A349453, A349564.

Sequence in context: A007462 A053623 A035010 * A055540 A006252 A079995

Adjacent sequences: A349447 A349448 A349449 * A349451 A349452 A349453

Keyword

sign

Author

Antti Karttunen, Nov 22 2021

Status

approved