43232

Appears in sequences

• Number of compositions of n when each odd part can be of two kinds.at n=11A052945
• G.f.: Sum_{k >= 1} (phi(k)/k)*log(1-f(x^k)), where f(x) = (1 - sqrt(1 - 4*x)) / (2*x) - 1 is the g.f. for the Catalan numbers (A000108) C_1, C_2, C_3, ...at n=10A060404
• Number of n-digit base-2 deletable digit-sum multiple (DSM) integers.at n=20A101216
• Let P(A) be the power set of an n-element set A and let B be the Cartesian product of P(A) with itself. Remove (y,x) from B when (x,y) is in B and x <> y and let R35 denote the reduced set B. Then a(n) = the sum of the sizes of the union of x and y for every (x,y) in R35.at n=7A133224
• a(n) = 169*n^2 - 2*n.at n=15A158218
• Irregular triangle read by rows: T(n,k) = number of homeomorphically irreducible connected labeled graphs with n vertices and k edges, n >= 1, 0 <= k <= n*(n-1)/2.at n=56A331438
• T(n, k) = [x^k] n! [t^n] 1/(exp((V*(2 + V))/(4*t))*sqrt(1 + V)) where V = W(-2*t*x) and W denotes the Lambert function. Table read by rows, T(n, k) for 0 <= k <= n.at n=39A343805
• Number of different multisets that can be obtained by choosing a prime index (or a prime factor) of each integer from 2 to n.at n=45A355746
• Number of different multisets that can be obtained by choosing a prime index (or a prime factor) of each integer from 2 to n.at n=46A355746
• Number of snake-like polyominoes in an n X n square that start at the NW corner and end at the SE corner and have the maximum length.at n=14A357516