106308
domain: N
Appears in sequences
- Numbers k such that sigma(phi(k)) = phi(sigma(k)).at n=21A033632
- Numbers k such that phi(2*sigma(k)) = 2*sigma(phi(k)).at n=25A067709
- Numbers k such that sigma(phi(k)) divides phi(sigma(k)).at n=35A073858
- Numbers k such that sigma(phi(k)) == phi(sigma(k)) (mod k), that is, A033632(k)/k is an integer.at n=23A092584
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 2-cell columns starting at level 0 (n >= 1; 0 <= k <= n-1).at n=37A121634
- 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, 0), (-1, 0, 1), (0, -1, 1), (1, 1, 0)}.at n=10A149245
- Number of (n+2)X(4+2) 0..3 arrays with every consecutive three elements in every row, column, diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=7A253040
- Number of rooted trees with n nodes such that two equals the maximal number of subtrees of the same size extending from the same node.at n=14A318817
- Lower (1/5,1/2) midsequence of (3^n) and (5*n); see Comments.at n=12A390563