OFFSET
1,1
COMMENTS
Primes that divide A073833(n) will divide A073834(m) for any m > n, and this is all the prime divisors of A073834(m).
Iterating f(x) = x + 1/x modulo p will eventually either produce a zero (in which case p is in this sequence), or it will loop to an earlier term (in which case it is not). Since f(-x) = -f(x), encountering the negation of an earlier term means that the iteration is looping.
Note that A073833(6) = 969581 = 521 * 1861 is the first composite member of that sequence.
PROG
(PARI) ina(p)=local(m, k, v); m=Mod(1, p); v=vector(p\2); while(m!=0, k=lift(m); if(2*k>p, k=p-k); if(v[k], return(0)); v[k]=1; m+=1/m); 1
CROSSREFS
KEYWORD
nonn
AUTHOR
Franklin T. Adams-Watters, Jun 11 2009
STATUS
approved