285311670612
domain: N
Appears in sequences
- a(n) = sigma_11(n), the sum of the 11th powers of the divisors of n.at n=10A013959
- Sierpiński numbers of the first kind: n^n + 1.at n=11A014566
- Numerator of sum of -11th powers of divisors of n.at n=10A017685
- a(n) = sigma_n(n): sum of n-th powers of divisors of n.at n=10A023887
- a(n) = 11^n + 1.at n=11A034524
- (Product k^k) * (Sum 1/k^k) where both the sum and product are over those positive integers k that divide n.at n=10A057642
- Inverse Moebius transform of f(n) = n^n (A000312).at n=10A062796
- a(n) = sigma_11(2n-1).at n=5A081867
- Numbers of the form (2n+1)^(2n+1) + 1.at n=5A085602
- a(n) = Sum {0<d|n, n/d odd} d^11.at n=10A096963
- a(n) = p^p + 1, where p = prime(n).at n=4A125137
- a(n) = Sum_{d|n} C(n,d)^(n/d).at n=10A174464
- Sum of n-th powers of unitary divisors of n (d such that d divides n, gcd(d, n/d) = 1).at n=10A238981
- Number of divisors of n^(n^n).at n=10A249784
- Sum of n-th powers of odd divisors of n.at n=10A292919
- a(n) = Sum_{d|n} d^(n^2/d).at n=10A308593
- a(n) = n^n * Product_{p|n, p prime} (1 + 1/p^n).at n=10A320974
- a(n) = Sum_{d|n} mu(d)^2*d^n.at n=10A321236
- a(n) = Sum_{d|n} (-1)^(n/d+1)*d^d.at n=10A321385
- a(n) = Sum_{d|n} (-1)^(n/d+1)*d^n.at n=10A321438