149760

Appears in sequences

• Jordan function J_4(n).at n=19A059377
• A unitary phi reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r * s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives s numbers.at n=21A080767
• A unitary phi reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r * s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives s numbers.at n=22A080767
• a(n) = 2*a(n-1) + 2*a(n-2); a(0)=0, a(1)=3.at n=12A083337
• Number of nX3 1..6 arrays containing at least one of each value, and all equal values connected.at n=2A166765
• A triangle related to the GF(z) formulas of the rows of the ED2 array A167560.at n=31A167568
• Expansion of (2/Pi)*elliptic_E(k) in powers of q.at n=14A194094
• Triangle read by rows: T(n,k) = A059383(n)/(A059383(k)*A059383(n-k)).at n=24A238754
• Number of nonisomorphic proper colorings of partition multicycle graph using six colors.at n=88A298266
• Numbers k such that A051378(k) > 2*k and A333926(k) <= 2*k.at n=2A349284