34529

Appears in sequences

• Number of dyslexic rooted planar trees with n nodes where any 2 subtrees extending from the same node are different.at n=15A032066
• Numbers k such that j(k)*phi(k) = sigma(phi(k)), j(k) = A033831(k).at n=13A033856
• Number of 0..1 arrays x(0..n-1) of n elements with each no smaller than the sum of its four previous neighbors modulo 2.at n=27A200462
• Number of nX3 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nX3 array.at n=6A219455
• Number of nX7 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nX7 array.at n=2A219459
• T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nXk array.at n=38A219460
• T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nXk array.at n=42A219460
• Number of partitions of n whose greatest part is a multiple of 5.at n=49A363047