%I A082285
%S A082285 13,29,45,61,77,93,109,125,141,157,173,189,205,221,237,253,269,285,301,
%T A082285 317,333,349,365,381,397,413,429,445,461,477,493,509,525,541,557,573,
%U A082285 589,605,621,637,653,669,685,701,717,733,749,765,781,797
%N A082285 Solutions to 7^x+11^x == 13 mod 17.
%H A082285 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A082285 a(n) = 16n-3. - Max Aleskeyev, Mar 03 2007
%o A082285 (PARI) \ solutions to 7^x+11^x == 13 mod 17 anpbn(n) = { for(x=1,n, if((7^x+11^x-13)%17==0,
               print1(x" "))) }
%Y A082285 Sequence in context: A120827 A044074 A044455 this_sequence A153422 A166034 
               A010337
%Y A082285 Adjacent sequences: A082282 A082283 A082284 this_sequence A082286 A082287 
               A082288
%K A082285 easy,nonn
%O A082285 1,1
%A A082285 Cino Hilliard (hillcino368(AT)gmail.com), May 10 2003