26135

Appears in sequences

• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (-1, 0, 1), (-1, 1, -1), (1, 0, 0)}.at n=11A148507
• a(n) = 24*n^2 - 1.at n=32A158544
• a(n) = 54*n^2 - 1.at n=21A158656
• G.f.: 1 + Sum_{n>=1} a(n)*x^n/(1 - x^n) = Product_{n>=1} (1 + n*x^n).at n=21A300278
• Number of partitions of 2n that describe the degree sequence of exactly one labeled multigraph with no loops.at n=37A328863
• Triangle read by rows. Number T(n, k) of partitions of the multiset [1, 1, 1, 1, 2, 2, 2, 2, ..., n, n, n, n] into k nonempty submultisets, for 1 <= k <= 4n.at n=34A358722