The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A036120 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A036120

a(n) = 2^n mod 19.
(history; published version)

#36 by Charles R Greathouse IV at Thu Sep 08 08:44:52 EDT 2022

PROG

(MAGMAMagma) [Modexp(2, n, 19): n in [0..100]]; // G. C. Greubel, Oct 17 2018

Discussion

Thu Sep 08

08:44

OEIS Server: https://oeis.org/edit/global/2944

#35 by N. J. A. Sloane at Sat Dec 07 12:18:21 EST 2019

PROG

(Sage) [power_mod(2, n, 19) for n in xrangerange(0, 66)] # Zerinvary Lajos, Nov 03 2009

Discussion

Sat Dec 07

12:18

OEIS Server: https://oeis.org/edit/global/2837

#34 by Susanna Cuyler at Wed Oct 17 21:43:00 EDT 2018

STATUS

proposed

approved

#33 by Muniru A Asiru at Wed Oct 17 11:51:26 EDT 2018

STATUS

editing

proposed

#32 by Muniru A Asiru at Wed Oct 17 11:46:01 EDT 2018

PROG

(GAP) List([0..60], n->PowerMod(2, n, 19)); # Muniru A Asiru, Oct 17 2018

STATUS

proposed

editing

#31 by Stefano Spezia at Wed Oct 17 11:02:28 EDT 2018

STATUS

editing

proposed

#30 by Stefano Spezia at Wed Oct 17 11:02:24 EDT 2018

PROG

(Python) for n in range(0, 100): print(int(pow(2**, n %, 19), ), end=' ') # Stefano Spezia, Oct 17 2018

STATUS

proposed

editing

#29 by Stefano Spezia at Wed Oct 17 10:20:46 EDT 2018

STATUS

editing

proposed

#28 by Stefano Spezia at Wed Oct 17 10:20:43 EDT 2018

PROG

(Python) for n in range(0, 100): print(int(2**n %19), end=' ') # Stefano Spezia, Oct 17 2018

STATUS

proposed

editing

#27 by Michel Marcus at Wed Oct 17 02:45:21 EDT 2018

STATUS

editing

proposed