The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A067936

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

Let rep(n) be the n-th repunit number, sequence gives values of n such that : rep(n) == rep(3) (mod n).
(history; published version)

#6 by Russ Cox at Fri Mar 30 18:38:52 EDT 2012

AUTHOR

_Benoit Cloitre (benoit7848c(AT)orange.fr), _, Mar 05 2002

Discussion

Fri Mar 30

18:38

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

#5 by N. J. A. Sloane at Sun Jun 29 03:00:00 EDT 2008

KEYWORD

easy,nonn,new

AUTHOR

Benoit Cloitre (abmtbenoit7848c(AT)wanadooorange.fr), Mar 05 2002

#4 by N. J. A. Sloane at Wed Sep 21 03:00:00 EDT 2005

KEYWORD

easy,nonn,new

AUTHOR

Benoit Cloitre (abcloitreabmt(AT)modulonetwanadoo.fr), Mar 05 2002

#3 by N. J. A. Sloane at Tue Jul 19 03:00:00 EDT 2005

KEYWORD

easy,nonn,new

AUTHOR

Benoit Cloitre (abcloitre(AT)wanadoomodulonet.fr), Mar 05 2002

#2 by N. J. A. Sloane at Sat Jun 12 03:00:00 EDT 2004

NAME

Let rep(n) be the n-th repunit number, sequence gives values of n such that : rep(n) == rep(3) (mod n).

KEYWORD

easy,nonn,new

#1 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003

NAME

Let rep(n) be the n-th repunit number, sequence gives values of n such that : rep(n)==rep(3) (mod n).

DATA

1, 2, 3, 4, 5, 6, 8, 10, 11, 12, 15, 20, 21, 24, 25, 30, 33, 39, 40, 50, 51, 55, 57, 60, 69, 75, 87, 93, 100, 105, 111, 120, 123, 125, 129, 141, 150, 159, 165, 177, 183, 195, 200, 201, 213, 219, 222, 231, 237, 249, 250, 267, 273, 275, 291, 300, 303, 309, 321, 327

OFFSET

1,2

CROSSREFS

Cf. A002275.

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (abcloitre(AT)wanadoo.fr), Mar 05 2002

STATUS

approved