3796875

Appears in sequences

• Numbers n such that sum of digits of n is equal to the sum of the prime factors of n, counted with multiplicity.at n=16A063737
• Expansion of g.f. (1-10x)/(1-15x).at n=6A091882
• A modular recurrence.at n=11A101553
• Number of set partitions of [n] such that i-j is a multiple of six for all i,j belonging to the same block.at n=23A275073
• Square array read by upward antidiagonals: T(n, k) = denominator( 2*k!*(-2)^k*Sum_{m=1..n}( 1/(2*m-1)^(k+1) ) ).at n=20A370691
• Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = -4.at n=30A380925