30263

Appears in sequences

• Numbers n such that sigma (phi ( n ) ) = sigma (sigma (n ) ) where phi is Euler's totient and sigma is the multiplicative sum-of-divisors function.at n=16A065556
• a(n) is the smallest positive multiple of 2n-1 that contains the binary representation of n in its binary representation and that is a palindrome when written in binary.at n=26A158789
• Auxiliary c(n) sequence used to prove some properties about Rowland's sequence. c(n) has the following recursive definition: c(1) = 5, c_(n+1) = c(n) + lfp(c(n)) - 1, where lpf(.) denotes the lowest prime factor of a number.at n=34A190894
• Number of (n+1)X(2+1) 0..4 arrays with every 2X2 subblock having the absolute values of all six edge and diagonal differences no larger than 1.at n=2A234030
• Number of (n+1) X (3+1) 0..4 arrays with every 2 X 2 subblock having the absolute values of all six edge and diagonal differences no larger than 1.at n=1A234031
• T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock having the absolute values of all six edge and diagonal differences no larger than 1.at n=7A234036
• T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock having the absolute values of all six edge and diagonal differences no larger than 1.at n=8A234036
• Absolute discriminants of imaginary quadratic number fields with elementary bicyclic 5-class group (5,5).at n=3A359871