[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 A233471 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) = 3^n mod n^2.
(history; published version)
#18 by Peter Luschny at Wed May 05 13:39:34 EDT 2021
STATUS

proposed

approved

#17 by Michel Marcus at Wed May 05 12:53:14 EDT 2021
STATUS

editing

proposed

#16 by Michel Marcus at Wed May 05 12:53:12 EDT 2021
NAME

a(n) = 3^n mod n^2.

PROG

(PARI) a(n) = lift(Mod(3, n^2)^n); \\ Michel Marcus, May 05 2021

STATUS

proposed

editing

#15 by F. Chapoton at Wed May 05 12:41:31 EDT 2021
STATUS

editing

proposed

#14 by F. Chapoton at Wed May 05 12:41:23 EDT 2021
PROG

for n in range(1, 100): print (str(3**n % n**2)+, end=', ', )

STATUS

approved

editing

Discussion
Wed May 05
12:41
F. Chapoton: adapt py code to py3
#13 by Harvey P. Dale at Tue Aug 27 13:37:08 EDT 2019
STATUS

editing

approved

#12 by Harvey P. Dale at Tue Aug 27 13:37:06 EDT 2019
MATHEMATICA

Table[PowerMod[3, n, n^2], {n, 100}] (* Harvey P. Dale, Aug 27 2019 *)

STATUS

approved

editing

#11 by Alois P. Heinz at Sun Dec 22 19:29:36 EST 2013
STATUS

editing

approved

#10 by Alois P. Heinz at Sun Dec 22 19:29:31 EST 2013
LINKS

Alois P. Heinz, <a href="/A233471/b233471.txt">Table of n, a(n) for n = 1..10000</a>

MAPLE

a:= n-> 3&^n mod n^2:

seq(a(n), n=1..60); # Alois P. Heinz, Dec 22 2013

STATUS

approved

editing

#9 by T. D. Noe at Fri Dec 13 17:34:47 EST 2013
STATUS

proposed

approved