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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A067937 Let rep(n) be the n-th repunit number, sequence gives values of n such that rep(n)==rep(4) (mod n). 0
 1, 2, 4, 5, 8, 10, 16, 20, 22, 25, 28, 37, 40, 44, 50, 52, 68, 70, 76, 80, 88, 92, 100, 110, 112, 116, 124, 125, 130, 148, 154, 164, 172, 176, 188, 200, 208, 212, 220, 236, 244, 250, 268, 280, 284, 286, 292, 316, 332, 340, 356, 364, 370, 388, 400, 404, 412, 418 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS MATHEMATICA Select[Range[500], Mod[FromDigits[PadRight[{}, #, 1]], #]==Mod[1111, #]&] (* Harvey P. Dale, Nov 12 2015 *) CROSSREFS Cf. A002275. Sequence in context: A191288 A181666 A067943 * A003592 A192716 A159765 Adjacent sequences:  A067934 A067935 A067936 * A067938 A067939 A067940 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.

Last modified November 30 17:12 EST 2021. Contains 349424 sequences. (Running on oeis4.)