44856
domain: N
Appears in sequences
- Composite numbers k such that phi(k) divides sigma(k) - 2*k.at n=26A068412
- Triangle read by rows: a(n,k) = number of paths of n upsteps U and n downsteps D that contain k UDUs.at n=49A097692
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, 1, -1), (1, 0, 0), (1, 1, 1)}.at n=8A150734
- Smallest k such that the fundamental unit (x+y*w) or (x+y*w)/2 of the real quadratic field Q(sqrt(k)) obeys gcd(k,y)=n.at n=34A197170
- Number of n X 3 nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 2 and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=18A252978
- Sum T(n,k) of multinomials M(n; lambda), where lambda ranges over all partitions of n into parts incorporating k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=38A327801
- Sum of multinomials M(n; lambda), where lambda ranges over all partitions of n into parts incorporating 2.at n=8A327828
- a(n) = Sum_{k=0..n} (-3)^(n-k) * binomial(3*n,k).at n=7A386700
- Numbers k such that sigma(k) = 2*k + 4*phi(k).at n=2A392692