49682

Appears in sequences

• a(n) = Sum_{d|n} (n/d)^(d-1).at n=31A087909
• Number of A095323-primes in range ]2^n,2^(n+1)].at n=19A095325
• Number of A095319-primes in range ]2^n,2^(n+1)].at n=19A095329
• Numbers n such that 3*10^n + 8*R_n + 1 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=21A102980
• Smallest number k>1 such that Sum_{i=1..k} Prime[i]^n divides Product_{i=1..k} Prime[i]^n.at n=5A118219
• Numbers whose trajectory under the Esucarys map ends at the fixed point 247.at n=41A129133
• Number of permutations of 3 indistinguishable copies of 1..n with exactly 3 adjacent element pairs in decreasing order.at n=3A151633
• Number of permutations of 3 indistinguishable copies of 1..n with exactly 6 adjacent element pairs in decreasing order.at n=3A151636
• Irregular triangle read by rows: T(n,k) = Sum_{i=0..k} (-1)^i * binomial(3*n+1,i) * binomial(k+3-i,3)^n, 0 <= k <= 3*(n-1).at n=15A174266
• Irregular triangle read by rows: T(n,k) = Sum_{i=0..k} (-1)^i * binomial(3*n+1,i) * binomial(k+3-i,3)^n, 0 <= k <= 3*(n-1).at n=18A174266
• Triangle in which the g.f. for row n is (1-x)^(4*n+1) * Sum_{j>=0} binomial(n+j-1,j)^4 * x^j, read by rows of k=0..3*n terms.at n=18A262014
• Triangle in which the g.f. for row n is (1-x)^(4*n+1) * Sum_{j>=0} binomial(n+j-1,j)^4 * x^j, read by rows of k=0..3*n terms.at n=15A262014
• a(n) = [x^n] (1-x)^(4*n+1) * Sum_{k>=0} binomial(n+k-1,k)^4 * x^k.at n=3A262015