|
| |
| |
|
|
|
13, 29, 45, 61, 77, 93, 109, 125, 141, 157, 173, 189, 205, 221, 237, 253, 269, 285, 301, 317, 333, 349, 365, 381, 397, 413, 429, 445, 461, 477, 493, 509, 525, 541, 557, 573, 589, 605, 621, 637, 653, 669, 685, 701, 717, 733, 749, 765, 781, 797, 813, 829, 845
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Solutions to 7^x+11^x == 13 mod 17.
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Tanya Khovanova, Recursive Sequences
|
|
|
FORMULA
| a(n) = 16n-3. - Max Aleskeyev, Mar 03 2007
a(n) = 32*n-a(n-1)+10; a(0)=13. - Vincenzo Librandi, Oct 10 2011
|
|
|
MATHEMATICA
| Range[13, 1000, 16] (* From Vladimir Joseph Stephan Orlovsky (4vladimir(AT)gmail.com), May 31 2011 *)
|
|
|
PROG
| (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" "))) }
(MAGMA) [[ n : n in [1..1000] | n mod 16 eq 13]]; // Vincenzo Librandi, Oct 10 2011
|
|
|
CROSSREFS
| Cf. A008598, A119413, A106839, A098502.
Sequence in context: A120827 A044074 A044455 * A153422 A166034 A010337
Adjacent sequences: A082282 A082283 A082284 * A082286 A082287 A082288
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)gmail.com), May 10 2003
|
| |
|
|
