88092

Appears in sequences

• T(2n,n-3), T given by A026758.at n=6A026871
• Scan decimal expansion of log(10) until all n-digit strings have been seen; a(n) is number of digits that must be scanned.at n=3A229124
• Number of (n+1) X (2+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=2A234906
• Number of (n+1) X (3+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=1A234907
• T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=7A234911
• T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=8A234911
• p-INVERT of (1,1,0,0,0,0,...), where p(S) = (1 - S)(1 - S^2).at n=19A291408
• Numbers k such that sigma(k + sigma(k)) = sigma(k) + sigma(sigma(k)), where sigma = A000203.at n=2A376831