65821

Appears in sequences

• Convolution of Fibonacci numbers and A000201.at n=19A023611
• Numbers n such that digits of n and the prime factorization of n are distinct and nonrepeating.at n=32A057885
• Table T(n,k) giving number of ways of obtaining exactly one correct answer on an (n,k)-matching problem (1 <= k <= n).at n=42A076732
• Numbers that together with their prime factors contain every digit exactly once.at n=5A124668
• Expansion of c(6*x^2)/(1-x*c(6*x^2)), where c(x) is the g.f. of A000108.at n=9A132373
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 0, 1), (1, 0, 0)}.at n=11A149811
• Number of n-ary words beginning with the first character of the alphabet, that can be built by inserting five doublets into the initially empty word.at n=7A194717
• Number of 7-ary words either empty or beginning with the first character of the alphabet, that can be built by inserting n doublets into the initially empty word.at n=5A194727
• 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=19A195814
• Triangle read by rows, T(n,k) n>=0, k>=0, generalization of A000255.at n=29A216154
• List of base-ten k-balanced factorization integers: The combined digits of an integer and its factorization primes and exponents contain exactly k copies of each of the ten digits, for some k.at n=3A273260
• 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=42A370970
• 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=58A372259