499968
domain: N
Appears in sequences
- Initial values for f(x)=phi(sigma(x)) such that iteration of f ends in cycle of length=15.at n=3A096889
- a(n) = sigma((4^n - 1)/3), where sigma(n) is the sum of positive divisors of n.at n=9A102359
- Weight distribution of [63,24,15] primitive binary BCH code.at n=28A151736
- Weight distribution of [63,24,15] primitive binary BCH code.at n=35A151736
- a(n) = ((2^b-1)/phi(n))*Sum_{d|n} Moebius(n/d)*d^(b-1) for b = 6.at n=7A160896
- Triangle read by rows. T(n,k) is the number of direct sum decompositions of GF(2)^n into subspaces of dimension at most k, 1<=k<=n.at n=11A298561
- Irregular triangular array read by rows. T(n,k) is the number of direct sum decompositions V_1 + V_2 + ... + V_m = GF(2)^n with the dimensions of the V_i corresponding to the k-th partition of n in canonical ordering, n >= 0, 1 <= k <= A000041(n).at n=22A358165
- Sum of the divisors of A001045(n) (Jacobsthal numbers).at n=19A366772
- Numbers k such that (sigma(k) - k)^(sigma(k) - k) == k (mod sigma(k)), where sigma = A000203.at n=44A375790