18375

Appears in sequences

• Number of partitions satisfying cn(0,5) + cn(1,5) <= cn(2,5) + cn(3,5) and cn(0,5) + cn(4,5) <= cn(2,5) + cn(3,5).at n=40A039886
• a(1)=6; if n = Product p_i^e_i, n>1, then a(n) = Product p_{i+1}^e_i * Product p_{i+2}^e_i.at n=17A045969
• Numbers k such that usigma(k) = phi(k)*omega(k), where omega(k) is the number of distinct prime divisors of k.at n=13A063795
• a(n) = 15*n^2.at n=35A064761
• Multiplicative closure of twin prime pair products (A037074).at n=21A074480
• Signed triangle used to compute column sequences of array A078741 ((3,3)-Stirling2).at n=25A090219
• Number of 8k+3 primes (A007520) in range [2^n,2^(n+1)].at n=19A095010
• Number of base 11 n-digit numbers with adjacent digits differing by one or less.at n=8A126365
• Number of permutations in S_n avoiding {bar 4}2153 (i.e., every occurrence of 2153 is contained in an occurrence of a 42153).at n=8A137536
• Numbers with exactly 3 distinct odd prime divisors {3,5,7}.at n=19A147576
• 7 times pentagonal numbers: a(n) = 7*n*(3*n-1)/2.at n=42A152744
• Expansion of (1+x)^50 * (1-x)/(1 - x^51).at n=3A173246
• Number of n X 8 binary arrays without the pattern 0 1 diagonally, vertically or antidiagonally.at n=9A188865
• Positive integers, c, such that there are more than two solutions to the equation a^2 + b^3 = c^4, with a, b > 0.at n=17A242381
• Integers of the form 8k+7 that can be written as a sum of four distinct squares of the form m, m+2, m+4, m+5, where m == 1 (mod 4).at n=16A243579
• Factorial base exp-function: digits in factorial base representation of n become the exponents of successive prime factors whose product a(n) is.at n=68A276076
• a(n) = gcd(A260443(n), A260443(n+1)).at n=38A277198
• a(n) = gcd(A260443(n), A260443(n+1)).at n=45A277198
• The difference between the number of partitions of 2n into odd parts (A000009) and the number of partitions of 2n into even parts (A035363).at n=36A282893
• Triangle I(m,n) read by rows: number of perfect lattice paths on the m*n board.at n=62A296449