76500
domain: N
Appears in sequences
- Expansion of 1/(1 - 3*x + x^2)^2.at n=9A001871
- a(n) = n*(n+1)*(n^2 - 3*n + 6)/4.at n=24A062026
- Number of 0's in even position in all Fibonacci binary words of length n. A Fibonacci binary word is a binary word having no 00 subword.at n=21A129722
- Triangle read by rows: T(n,k) is the number of ternary words (i.e., finite sequences of 0's, 1's and 2's) of length n having k occurrences of 01's (0 <= k <= floor(n/2)).at n=37A181371
- Numbers with prime factorization p*q^2*r^2*s^3 (where p, q, r, s are distinct primes).at n=36A190109
- Numbers that are both exponential and nonexponential abundant numbers.at n=25A348627
- 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=5A380926