34902

Appears in sequences

• Polar structured meta-anti-diamond numbers, the n-th number from a polar structured n-gonal anti-diamond number sequence.at n=17A100188
• Diagonal sums of the Riordan array A116382.at n=17A116384
• Number of base pyramids in all dispersed Dyck paths of length n (i.e., in all Motzkin paths of length n with no (1,0)-steps at positive heights).at n=16A191394
• Numbers k which use half of the ten digits such that they have at least one factorization k=p*q that uses remaining half of the digits that are not in k.at n=15A195814
• Number of partitions p of n such that floor(mean(p)) is a part and ceiling(mean(p)) is not.at n=47A241342
• Number of nonnegative integers with property that their base 7/5 expansion (see A024642) has n digits.at n=27A245423
• Numbers n = p * q, where n, p, and q together contain all 10 digits at least once.at n=31A253172
• Values n, where n = p * q, and n, p, and q together contain all 10 digits at least once, and no digit is in more than one of n, p or q.at n=16A253173
• Indices of primes in the 9th-order Fibonacci number sequence, A127193.at n=27A256498
• Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its west or southwest neighbor modulo 3 and the upper left element equal to 0.at n=8A267073
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any west or southwest neighbors modulo n and the upper left element equal to 0.at n=57A267562
• Number of nX4 0..1 arrays with every element equal to 0, 1, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=11A300085
• Number of oriented colorings of the tetrahedral facets (or vertices) of a regular 4-dimensional simplex using n or fewer colors.at n=17A337895
• Expansion of Sum_{k>0} x^(2*k)/(1+x^k)^6.at n=19A363614
• Numbers k which have a factorization k = f1*f2*...*fr where the digits of {k, f1, f2, ..., fr} together give 0,1,...,9 exactly once.at n=37A370970
• Numbers k which have a factorization k = f_1*f_2*...*f_r where f_i >= 1 and the digits of {k, f_1, f_2, ..., f_r} together give 0,1,...,9 exactly once.at n=53A372259
• Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete bipartite graph using exactly k interchangeable colors, 2 <= k <= 2*n.at n=44A384968