39700

Appears in sequences

• Number of ways of transforming a set of n indistinguishable objects into n singletons via a sequence of n-1 refinements.at n=11A002846
• Triangle read by rows: T(n,k) is the number of labeled monoids of order n with k idempotents and a fixed identity.at n=17A058158
• a(n) = 4*n^4 - 3*n^2.at n=9A079414
• Triangle, read by rows, where the n-th row lists the coefficients of the polynomial of degree n, with root -1, that generates the n-th diagonal of this sequence.at n=58A091173
• Decagonal numbers divisible by 10.at n=20A117797
• Arises in covering a graph by forests and a matching.at n=23A179259
• Numbers n such that the n-th digit (after the decimal point) in the decimal expansion of Pi are the occurrence of the least significant digit represented by the more significant digits.at n=27A201545
• Numbers k such that Bernoulli number B_{k} has denominator 33330.at n=14A295589
• In the ranked poset of integer partitions ordered by refinement, number of maximal chains from the local minimum to the partition with Heinz number n.at n=36A300384