[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A081116
Numbers k such that 17 divides 3^k-k.
1
5, 29, 42, 75, 132, 134, 140, 152, 159, 162, 163, 201, 206, 215, 241, 256, 277, 301, 314, 347, 404, 406, 412, 424, 431, 434, 435, 473, 478, 487, 513, 528, 549, 573, 586, 619, 676, 678, 684, 696, 703, 706, 707, 745, 750, 759, 785, 800, 821, 845, 858, 891, 948
OFFSET
1,1
COMMENTS
Suggested by a problem in a web page by Hojoo Lee entitled "Challenging problems in number theory". However, the page no longer exists.
LINKS
Index entries for linear recurrences with constant coefficients, signature (2,-2,2,-2,2,-2,2,-2,2,-2,2,-2,2,-2,2,-1).
FORMULA
a(n+1)-a(n) is the 16-periodic sequence (24, 13, 33, 57, 2, 6, 12, 7, 3, 1, 38, 5, 9, 26, 15, 21).
MATHEMATICA
Select[Range[1000], PowerMod[3, #, 17] == Mod[#, 17] &] (* Amiram Eldar, May 14 2022 *)
PROG
(PARI) isok(n) = Mod(3, 17)^n == Mod(n, 17); \\ Michel Marcus, Dec 02 2013
CROSSREFS
Cf. A024024 (3^n-n).
Sequence in context: A340154 A117746 A156053 * A192090 A268673 A146829
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Apr 16 2003
STATUS
approved