38304

Appears in sequences

• Coefficient of x^5 in expansion of (1 + x + x^2)^n.at n=17A000574
• a(n) is the concatenation of n and 8n.at n=37A009470
• T(4n,n), where T is the array in A026323.at n=5A026334
• Triangle of number of permutations of {1, 2, ..., n} having exactly k cycles, each of which is of length >=r for r=3.at n=10A050211
• Numbers k that, when expressed in base 6 and then interpreted in base 8, give a multiple of k.at n=27A062937
• 9 times octagonal numbers: a(n) = 9*n*(3*n-2).at n=38A064201
• Numbers k such that phi(k) = 2*tau(k)^2.at n=28A068564
• Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 3.at n=9A094803
• a(n) = 5*n^5 - 3*n^3 + 2*n^2. Coefficients and exponents are the prime numbers in decreasing order.at n=6A134631
• Partition number array, called M32hat(-4)= 'M32(-4)/M3'= 'A144267/A036040', related to A011801(n,m)= |S2(-4;n,m)| (generalized Stirling triangle).at n=31A144284
• Partition number array, called M32hat(-4)= 'M32(-4)/M3'= 'A144267/A036040', related to A011801(n,m)= |S2(-4;n,m)| (generalized Stirling triangle).at n=50A144284
• Triangle T(n, k) = n! * (Harmonic number(n-k) - Harmonic number(k)), read by rows.at n=38A157525
• Numbers with prime factorization pqr^2s^5.at n=14A190293
• Number of compositions of n in which the minimal multiplicity of parts equals 2.at n=17A244165
• Numbers m such that b^sigma(m) == b^phi(m) == b^numdiv(m) == b^m (mod m) for every integer b.at n=34A277173
• Number of 4 X n integer matrices (m_{i,j}) such that m_{1,1}=0, m_{4,n}=2, and all rows, columns, and falling diagonals are (weakly) monotonic without jumps of 2.at n=9A323968
• Number of 9 X n integer matrices (m_{i,j}) such that m_{1,1}=0, m_{9,n}=2, and all rows, columns, and falling diagonals are (weakly) monotonic without jumps of 2.at n=4A323973
• Fourier coefficients of a modular form studied by Koike.at n=10A341304
• Triangle read by rows: T(n,k) is the number of pairs (c,m), where c is a covering of the 1 X (2n) grid with 1 X 2 rectangles and equal numbers of red and blue 1 X 1 squares and m is a matching between red squares and blue squares, such that exactly k matched pairs are adjacent.at n=33A360441
• a(n) is the least number with exactly n divisors of the form 5*k+1.at n=17A364586