22380

Appears in sequences

• Number of irreducible polyhedral graphs with n nodes.at n=10A006866
• Number of partitions of n into at most 9 parts.at n=44A008638
• Number of partitions of n into 9 unordered relatively prime parts.at n=44A023029
• Number of partitions of n in which the greatest part is 9.at n=53A026815
• Number of planar planted trees with n non-root nodes and without isolated 2-valent nodes.at n=13A061575
• Number of 1's in binary expansion of parts in all partitions of n.at n=25A066624
• Polynexus numbers of order 7.at n=8A083200
• 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, 1), (-1, 0, 1), (0, 1, 0), (1, 0, -1), (1, 1, 0)}.at n=8A150167
• Augmentation of the triangle A008949. See Comments.at n=32A193603
• Total sum of the numbers of partitions with positive k-th ranks of all partitions of n.at n=28A208479
• Number of length n+2 0..1 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=17A256817
• Iterations at which Langton's Ant living on triangular tiling reaches the distance of n from the origin for the first time.at n=41A275303
• a(n) = Sum_{d|n} d*binomial(d+2,3).at n=17A321598
• The number of regions inside a pentagon formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts.at n=5A331929
• Number of partitions of n into 9 distinct and relatively prime parts.at n=44A341913
• Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph.at n=30A367323
• Integers k such that the sum of the first k noncubes is a square.at n=9A373767
• a(n) = Sum_{k=0..floor(n/3)} binomial(n-3*k,floor(k/3)).at n=57A376696