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!)
A067938 Let rep(n) be the n-th repunit number, sequence gives values of n such that rep(n)==rep(5) (mod n). 0
1, 2, 4, 5, 8, 10, 11, 16, 20, 25, 32, 35, 40, 50, 55, 65, 74, 77, 80, 85, 95, 100, 101, 115, 125, 143, 145, 155, 160, 185, 200, 205, 215, 235, 250, 265, 275, 295, 296, 305, 335, 355, 365, 395, 400, 407, 410, 415, 445, 455, 485, 500, 505, 515, 535, 545, 565, 620 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..58.

CROSSREFS

Cf. A002275.

Sequence in context: A191986 A018699 A073628 * A306073 A018457 A046809

Adjacent sequences:  A067935 A067936 A067937 * A067939 A067940 A067941

KEYWORD

easy,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 26 21:33 EDT 2021. Contains 348269 sequences. (Running on oeis4.)