133140
domain: N
Appears in sequences
- Number of cycles induced by iterating the Gray-coding of an n-bit number: a(n+1) = a(n) + 2^n/C_n, where C_n = least power of 2 >= n (C_n is the length of the cycle), with a(0) = 1.at n=22A007886
- Number of n X 2 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,2,1,0,4 for x=0,1,2,3,4.at n=11A196976
- Smallest b > 1 such that b^(p-1) == 1 (mod p^5) for p = prime(n).at n=7A353938
- Expansion of e.g.f. (1/x) * Series_Reversion( x*(1 + x*log(1-x)) ).at n=7A370993