login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067935 Let rep(n) be the n-th repunit number, sequence gives values of n such that : rep(n)==rep(2) (mod n). 1
1, 2, 4, 5, 10, 14, 20, 22, 25, 26, 34, 38, 44, 46, 50, 58, 62, 74, 82, 86, 94, 100, 106, 110, 118, 122, 134, 140, 142, 146, 158, 166, 178, 182, 185, 194, 202, 206, 214, 218, 220, 226, 254, 260, 262, 274, 278, 298, 302, 308, 314, 326, 334, 346, 350, 358, 362 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

(10^5-1)/9 = 11+5*2220, hence 5 is in the sequence.

LINKS

Robert Israel, Table of n, a(n) for n = 1..10000

MAPLE

filter:= n -> 10&^n -100 mod (9*n) = 0:

select(filter, [$1..400]); # Robert Israel, Jul 02 2019

CROSSREFS

Cf. A002275, A095250 (rep(n) mod n).

Sequence in context: A008283 A002237 A329136 * A228893 A272622 A097133

Adjacent sequences:  A067932 A067933 A067934 * A067936 A067937 A067938

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Mar 05 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 13:49 EDT 2021. Contains 348170 sequences. (Running on oeis4.)