166624
domain: N
Appears in sequences
- 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, 0, 0), (1, -1, 1), (1, 0, 1), (1, 1, -1)}.at n=11A148804
- Number of n X 4 0..1 arrays with the number of 1's horizontally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1.at n=4A285148
- T(n,k) = Number of n X k 0..1 arrays with the number of 1s horizontally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1.at n=32A285152
- Number of 5 X n 0..1 arrays with the number of 1's horizontally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1.at n=3A285156
- Numbers k such that uphi(k)*usigma(k) = uphi(k+1)*usigma(k+1), where uphi is the unitary totient function (A047994) and usigma the sum of unitary divisors (A034448).at n=18A297365
- Numbers k such that s(k) = s(k+1), where s(k) is the unitary analog of the alternating sum-of-divisors function (A307037).at n=38A333408
- Numbers k such that A173557(k) = A173557(k+1).at n=27A333874
- Numbers k such that k and k+1 have the same average of unitary divisors.at n=40A349222
- Numbers k such that sigma(k) = psi(k) + phi(k).at n=24A389478