Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067938
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
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; listen)
OFFSET

1,2

CROSSREFS

Cf. A002275.

Sequence in context: A066208 A018699 A073628 this_sequence A018457 A046809 A112777

Adjacent sequences: A067935 A067936 A067937 this_sequence A067939 A067940 A067941

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research