42510

Appears in sequences

• G.f. A(x) satisfies A(x/A(x)^3) = 1 + x ; thus A(x) = 1 + series_reversion(x/A(x)^3).at n=6A120972
• a(n) = number of L-convex polyominoes inscribed in an (n+1) X (n+1) box.at n=5A126765
• Square array read by antidiagonals: T(m,n) is the number of L-convex polyominoes with m rows and n columns.at n=60A181370
• a(n) is n-th term of the Euler transform of -n,1,1,1,... .at n=16A292541
• Number of multisets of exactly ten partitions of positive integers into distinct parts with total sum of parts equal to n.at n=20A320795
• a(n) is the smallest number that can be partitioned into n ways as the sum of two brilliant numbers (A078972).at n=41A338474
• Expansion of Sum_{k>0} (1/(1-x^k)^6 - 1).at n=18A363696
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A120973.at n=41A381603
• a(n) = Sum_{k=0..n} abs(Stirling1(n,k)) * Stirling2(n,n-k).at n=6A384501