38073

Appears in sequences

• a(n) = floor(10000*log_2(n)).at n=13A004268
• Number of binary codes of length 5 with n words.at n=11A034190
• Number of binary codes of length 5 with n words.at n=21A034190
• Number of binary codes (not necessarily linear) of length n with 11 words.at n=4A034206
• Irregular triangle read by rows: T(n,k) = number of binary codes of length n with k words (n >= 0, 0 <= k <= 2^n); also number of 0/1-polytopes with vertices from the unit n-cube; also number of inequivalent Boolean functions of n variables with exactly k nonzero values under action of Jevons group.at n=47A039754
• Irregular triangle read by rows: T(n,k) = number of binary codes of length n with k words (n >= 0, 0 <= k <= 2^n); also number of 0/1-polytopes with vertices from the unit n-cube; also number of inequivalent Boolean functions of n variables with exactly k nonzero values under action of Jevons group.at n=57A039754
• Numbers which can be expressed as the product of numbers made of only sevens.at n=14A161145
• Triangle read by columns: Distinct classifications of N elements containing exactly R binary partitions.at n=41A171872
• Mutual solutions to two classification counting problems: binary block codes of wordlength J with N used words; and classifications of N elements by J partitions.at n=26A171876
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 155", based on the 5-celled von Neumann neighborhood.at n=38A270327
• Self-locating numbers within the Copeland-Erdős constant: numbers k such that the string k is at the 0-indexed position k in the decimal digits of the concatenation of the prime numbers as a decimal sequence.at n=3A334259