22300
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n and having k ascents (0<=k<=floor(n/3)).at n=53A114712
- Number of binary strings of length n with equal numbers of 00010 and 10001 substrings.at n=15A164220
- Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0)-steps at positive heights) having k DHU's (here U=(1,1), H=(1,0), and D=(1,-1)).at n=43A191397
- Number of (w,x,y,z) with all terms in {1,...,n} and w+x>=2y+2z.at n=20A212565
- Number of partitions p of n such that the number of numbers p having multiplicity 1 in p is not a part and the number of numbers having multiplicity > 1 is not a part.at n=48A241417
- Numbers k such that Bernoulli number B_{k} has denominator 33330.at n=4A295589
- Number of maximal primitive subsets of {1..n}.at n=46A326077
- Number of maximal primitive subsets of {1..n}.at n=47A326077
- Number of distinct intersections among all circles that can be constructed on vertices of an n-sided regular polygon, using only a compass.at n=19A331702