[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”).

Revision History for A081116 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Numbers k such that 17 divides 3^k-k.
(history; published version)
#20 by Michael De Vlieger at Sun May 15 07:30:24 EDT 2022
STATUS

reviewed

approved

#19 by Joerg Arndt at Sun May 15 01:29:52 EDT 2022
STATUS

proposed

reviewed

#18 by Amiram Eldar at Sat May 14 12:47:11 EDT 2022
STATUS

editing

proposed

#17 by Amiram Eldar at Sat May 14 12:46:56 EDT 2022
PROG

(PARI) isok(n) = (Mod(3, 17)^n- == Mod(n) % , 17) == 0; \\ Michel Marcus, Dec 02 2013

STATUS

reviewed

editing

Discussion
Sat May 14
12:47
Amiram Eldar: Fixed.
#16 by Joerg Arndt at Sat May 14 07:36:44 EDT 2022
STATUS

proposed

reviewed

Discussion
Sat May 14
07:37
Joerg Arndt: remove inefficient Pari code?
#15 by Amiram Eldar at Sat May 14 05:55:03 EDT 2022
STATUS

editing

proposed

#14 by Amiram Eldar at Sat May 14 05:51:50 EDT 2022
LINKS

<a href="/index/Rec#order_16">Index entries for linear recurrences with constant coefficients</a>, signature (2,-2,2,-2,2,-2,2,-2,2,-2,2,-2,2,-2,2,-1).

#13 by Amiram Eldar at Sat May 14 05:50:58 EDT 2022
NAME

Numbers n k such that 17 divides 3^nk-nk.

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 *)

#12 by Amiram Eldar at Sat May 14 05:50:05 EDT 2022
LINKS

Amiram Eldar, <a href="/A081116/b081116.txt">Table of n, a(n) for n = 1..10000</a>

STATUS

approved

editing

#11 by Bruno Berselli at Mon Dec 02 10:28:45 EST 2013
STATUS

proposed

approved