login
A157742
A006094(n+3) mod 9.
4
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,1
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.
CROSSREFS
Sequence in context: A119812 A153799 A086235 * A200134 A021542 A336058
KEYWORD
nonn,easy
AUTHOR
Paul Curtz, Mar 05 2009
EXTENSIONS
Edited by R. J. Mathar, Apr 01 2009
STATUS
approved