593311

Appears in sequences

• Number of lattice paths from (0,0) to (n,n) using steps (0,1), (1,0), (2,2), (3,3).at n=10A192417
• a(n) is the number of distinct ways to partition the set {1,2,...,n} into nonempty subsets such that the sum of the pi(x)*(pi(x) + 1)/2 values of each subset's size x equals n, where pi() is the prime counting function given by A000720.at n=22A364525