19735

Appears in sequences

• Molien series for A_9.at n=43A008632
• Number of binary codes of length 6 with n words.at n=7A034191
• Number of binary codes (not necessarily linear) of length n with 7 words.at n=5A034202
• Min[x] composite zero site for sigma(x+6^n) - sigma(x) - 6^n.at n=7A055036
• Number of permutations of length n that avoid the patterns 132, 4321.at n=23A116701
• Start with 1 and repeatedly reverse the digits and add 66 to get the next term.at n=35A118200
• 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=38A171876
• Numbers k that are the products of two distinct primes such that 2*k-1, 4*k-3, 8*k-7, 16*k-15 and 32*k-31 are also products of two distinct primes.at n=27A177214
• Numbers k that are the products of two distinct primes such that 2*k-1, 4*k-3, 8*k-7, 16*k-15, 32*k-31 and 64*k-63 are also products of two distinct primes.at n=10A177215
• Number of strings of numbers x(i=1..4) in 0..n with sum i*x(i) equal to n*4.at n=44A184704
• Number of (n+1) X (1+1) 0..2 arrays with the maximum plus the lower median minus the upper median of every 2 X 2 subblock equal.at n=4A237092
• Number of (n+1) X (5+1) 0..2 arrays with the maximum plus the lower median minus the upper median of every 2 X 2 subblock equal.at n=0A237096
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock equal.at n=10A237099
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median minus the upper median of every 2X2 subblock equal.at n=14A237099
• a(n) = number of steps to reach 0 when starting from k = n^3 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm.at n=55A261227
• Number of length-n ternary sequences where the sum of each block differs by at most 1 from every other block of the same length.at n=45A274008
• Number of 0/1 n-simplices formed from vertices of unit n-dimensional cube, including degenerate ones.at n=5A276412
• The triangle in A039754 but with rows truncated at k = n.at n=27A276777
• a(n) is the smallest positive integer which can be represented as the sum of n distinct nonzero square pyramidal numbers in exactly n ways, or -1 if no such integer exists.at n=17A360218