80088

Appears in sequences

• Smallest number with persistence n for the sort-and-subtract-sequence.at n=26A065641
• Prime(prime(n))^2-1.at n=17A092771
• Numbers whose base 10 digits are a subset of {0, 8}.at n=19A204095
• Number of (n+1)X5 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.at n=2A205732
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.at n=17A205736
• Number of 4X(n+1) 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.at n=3A205739
• Number of 2Xn 0..1 arrays with no 1 equal to more than one of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element.at n=9A283573
• Numbers of the form A000217(n)*A007494(n) that are divisible by 3.at n=39A295867
• Numbers of the form (p+1)*(p+3) where (p,p+2) is a twin prime pair (cf. A001359).at n=18A362941
• Let p = A002145(n) be the n-th prime == 3 (mod 4); a(n) is the multiplicative order of 2+-i modulo p in Gaussian integers.at n=31A385165