20354

Appears in sequences

• Coordination sequence for root lattice B_3.at n=32A022145
• Number of ternary rooted trees with n nodes and height at most 5.at n=18A036373
• Numbers n such that p(5n) is prime, where p(n) is the number of partitions of n.at n=39A114166
• Number of partitions of n into exactly 7 different parts with distinct multiplicities.at n=19A212118
• a(n) = ceiling( Pi^(n/3) ).at n=25A212463
• Triangle read by rows: number of permutations of [1..n] with k progressions of rise 2, distance 1 and length 3 (n >= 0, k >= 0).at n=27A216716
• Number of partitions of n such that the number of parts having multiplicity 1 is a part or the number of distinct parts is a part.at n=38A241446
• Number of nonequivalent maximal irredundant sets in the n-cycle graph up to rotation.at n=34A291048
• Expansion of Product_{i>=1, j>=1, k>=1, l>=1} (1 - x^(i*j*k*l))/(1 + x^(i*j*k*l)).at n=20A321302
• Number of equivalence classes of convex lattice polygons of genus n, restricting the count to those polygons that are interior to another polygon.at n=28A322344
• Result of inserting the integers n = 0, 1, 2, ... in this order into an initially empty list, where n is inserted between the pair of consecutive elements with sum equal to n and minimal absolute difference, or at the end of the list if no such pair exists.at n=47A360447