|
| |
|
|
A082286
|
|
a(n) = 18*n + 10.
|
|
3
| |
|
|
10, 28, 46, 64, 82, 100, 118, 136, 154, 172, 190, 208, 226, 244, 262, 280, 298, 316, 334, 352, 370, 388, 406, 424, 442, 460, 478, 496, 514, 532, 550, 568, 586, 604, 622, 640, 658, 676, 694, 712, 730, 748, 766, 784, 802, 820, 838, 856, 874, 892, 910, 928, 946
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Solutions to 11^x+13^x == 17 mod 19.
a(n) = A006370(A016945(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 17 2008
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..2000
Tanya Khovanova, Recursive Sequences
|
|
|
MATHEMATICA
| Range[10, 1000, 18] (* From Vladimir Joseph Stephan Orlovsky (4vladimir(AT)gmail.com), June 01 2011 *)
|
|
|
PROG
| (MAGMA) [18*n + 10: n in [0..60]]; // Vincenzo Librandi, May 05 2011
|
|
|
CROSSREFS
| Cf. A008600, A161705.
Sequence in context: A054501 A112353 A031077 * A088407 A069953 A113746
Adjacent sequences: A082283 A082284 A082285 * A082287 A082288 A082289
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)gmail.com), May 10 2003
|
|
|
EXTENSIONS
| More terms from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 17 2008
|
| |
|
|
