A157742 A006094(n+3) mod 9.

8, 5, 8, 5, 8, 5, 1, 8, 4, 5, 8, 5, 7, 4, 8, 1, 5, 8, 7, 5, 7, 2, 5, 8, 5, 8, 5, 5, 5, 1, 8, 2, 8, 1, 4, 5, 1, 7, 8, 2, 8, 5, 8, 4, 1, 5, 8, 5, 4, 8, 2, 4, 1, 7, 8, 7, 5, 8, 2, 5, 5, 8, 5, 5, 1, 2, 8, 5, 7, 2, 1, 4, 5, 1, 2, 5, 2, 2, 8, 2, 8, 7, 5, 7, 2, 5, 8, 5, 7, 2, 5, 2, 5, 4, 4, 8, 1, 7, 2, 4, 1, 8, 4, 2, 7

Offset: 0

Author

Paul Curtz, Mar 05 2009

Keywords

• nonn
• easy

Comments

Values of 0, 3 or 6 are obviously absent, because that would indicate divisibility by 3 which does not happen for prime products involving primes >3.

Formula

a(n) = A038194(n+3)*A038194(n+4) mod 9.

Extensions

Edited by R. J. Mathar, Apr 01 2009