126882
domain: N
Appears in sequences
- Triangle T(n,k) read by rows, defined by T(n,k) = (n-k)*T(n-1,k)+Sum(k=1..n, T(n-1,k)); T(1,1) = 1, T(1,k)= 0 if k >1.at n=30A089225
- Numbers n such that sigma(n) = 10*phi(n) (where sigma=A000203, phi=A000010).at n=16A171256
- Numbers k such that k^k = k (mod prime(k)).at n=10A177005
- Number of n X 3 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors not equal to itself.at n=13A265987