OFFSET
1,1
COMMENTS
The base-4 representation of a term 4^i + 4^j - 1 has base-4 digital sum = 1 + 3*j == 1 (mod 3).
In base-4 representation the first terms are 103, 1003, 1033, 10033, 100033, 100333, 103333, 1000003, 1000033, 1000333, 1033333, 10000333, 10333333, 100000003, 100000033, 100000333, 103333333, 1000000003, 1000003333, 1000033333, ...
Numbers m which satisfy m = 4^i + 4^j + 1 are never primes, since the base-4 digital sum of m is 3, and thus, m is divisible by 3.
LINKS
Hieronymus Fischer, Table of n, a(n) for n = 1..111
EXAMPLE
a(1) = 19, since 19 = 4^2 + 4^1 - 1 is prime.
a(4) = 271, since 271 = 4^4 + 4^2 - 1 is prime.
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
Hieronymus Fischer, Apr 14 2014
STATUS
approved