394065

Appears in sequences

• a(n) = 15*binomial(n,6)-6*binomial(n-2,4)+binomial(n-4,4).at n=15A274311
• Odd numbers k for which A003961(k) > 2*k and A003961(k)-2*k OR A003961(k)-sigma(k) = A003961(k)-2*k, where OR is bitwise-or (A003986) and A003961 is fully multiplicative with a(p) = nextprime(p).at n=16A388029