80519
domain: N
Appears in sequences
- Least k >= 2 with n^(kn) == n (mod kn), also n^(kn-1) == 1 (mod k).at n=0A102457
- a(n) = A102457(k) for k in A102458. For these k, A102457(k) != lpf(k-1).at n=0A102459
- Numbers k such that 4^k == 2 (mod k).at n=5A130421
- Number of n X n 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,3,0,1,2 for x=0,1,2,3,4.at n=4A198007
- Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,3,0,1,2 for x=0,1,2,3,4.at n=4A198010
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,3,0,1,2 for x=0,1,2,3,4.at n=40A198013
- Number of (n+3) X 4 0..2 matrices with each 4 X 4 subblock idempotent.at n=12A224721
- a(n) is the smallest composite k such that k divides 2^(k*n-1) - 1.at n=1A317556
- Numbers k such that 2^(2*k-1) == 1 (mod k).at n=1A347906