36508

Appears in sequences

• 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=16A195814
• Numbers n = p * q, where n, p, and q together contain all 10 digits at least once.at n=40A253172
• 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=19A253173
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 417", based on the 5-celled von Neumann neighborhood.at n=39A272018
• Number of nX5 0..1 arrays with each 1 adjacent to 3, 4 or 6 king-move neighboring 1s.at n=6A297017
• Number of nX7 0..1 arrays with each 1 adjacent to 3, 4 or 6 king-move neighboring 1s.at n=4A297019
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 3, 4 or 6 king-move neighboring 1s.at n=59A297020
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 3, 4 or 6 king-move neighboring 1s.at n=61A297020
• Expansion of e.g.f.: exp(exp(x) + x^2 - 1).at n=8A355337
• 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=38A370970
• 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=54A372259