69825

Appears in sequences

• Number of inequivalent linear ternary codes of length n with no zero columns. Also the number of nonisomorphic loopless ternary matroids on an n-set.at n=10A076893
• a(n) = 6*a(n-1) + 5*(2^(n-1)-1) for n > 0, a(0) = 0.at n=7A241275
• Least odd primitive abundant number having its prime signature.at n=12A316116
• Least composite such that complementing one bit in its binary representation at a time produces exactly n primes.at n=12A322743
• Numbers m such that both m^2-1 and m^2 are refactorable numbers (A033950) and that m^2 has more divisors than m^2-1.at n=32A342970
• Primitive abundant numbers for which there is no smaller primitive abundant number having the same ordered prime signature.at n=24A357921
• Numbers that are divisible by the squares of two distinct primes and whose arithmetic derivative (A003415) is a squarefree number of the form 4k+2.at n=17A368697
• Positions of records in A383271.at n=12A383272
• Odd numbers k such that gcd(A276086(sigma(k)-k), A276086(k)) is equal to A276086(k), where A276086 is the primorial base exp-function, and sigma is the sum of divisors function.at n=36A388267