The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A064434

a(n) = (2*a(n-1) + 1) mod n.
(history; published version)

#21 by Charles R Greathouse IV at Thu Sep 08 08:45:04 EDT 2022

PROG

(MAGMAMagma) [n le 1 select n-1 else (2*Self(n-1)+1) mod n: n in [1..80]]; // Vincenzo Librandi, Jun 24 2018

Discussion

Thu Sep 08

08:45

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

#20 by Bruno Berselli at Thu Jun 28 04:48:39 EDT 2018

STATUS

reviewed

approved

#19 by Joerg Arndt at Thu Jun 28 04:22:16 EDT 2018

STATUS

proposed

reviewed

#18 by Jon E. Schoenfield at Mon Jun 25 19:35:03 EDT 2018

STATUS

editing

proposed

#17 by Jon E. Schoenfield at Mon Jun 25 19:34:53 EDT 2018

PROG

(MAGMA) [n le 1 select n-1 else ((2*Self(n-1)+1) mod n): n in [1..80]]; // Vincenzo Librandi, Jun 24 2018

STATUS

proposed

editing

Discussion

Mon Jun 25

19:35

Jon E. Schoenfield: Thanks, Bruno.  Okay like this?

#16 by Jon E. Schoenfield at Sun Jun 24 16:10:04 EDT 2018

STATUS

editing

proposed

Discussion

Mon Jun 25

05:23

Bruno Berselli: Unnecessary parenthesis in Magma code ---

#15 by Jon E. Schoenfield at Sun Jun 24 16:09:57 EDT 2018

COMMENTS

a(n) is the remainder when (2*a(n-1) + 1) is divided by n.

FORMULA

a(n) = (a(n-1) * 2 + 1 ) mod n.

STATUS

proposed

editing

Discussion

Sun Jun 24

16:10

Jon E. Schoenfield: Okay like this?

#14 by Muniru A Asiru at Sun Jun 24 11:28:53 EDT 2018

STATUS

editing

proposed

#13 by Muniru A Asiru at Sun Jun 24 11:25:06 EDT 2018

PROG

(GAP) a:=[0];; for n in [2..90] do a[n]:=(2*a[n-1]+1) mod n; od; a; # Muniru A Asiru, Jun 24 2018

STATUS

proposed

editing

#12 by Vincenzo Librandi at Sun Jun 24 01:58:18 EDT 2018

STATUS

editing

proposed

Discussion

Sun Jun 24

02:38

Michel Marcus: keep former name in comments ?