Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067940
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067940 Let rep(n) be the n-th repunit number, sequence gives values of n such that rep(n)==rep(7) (mod n). +0
1
1, 2, 4, 5, 7, 8, 10, 11, 13, 16, 20, 25, 32, 37, 40, 49, 50, 55, 64, 80, 82, 91, 100, 125, 128, 133, 148, 160, 175, 200, 217, 250, 259, 275, 301, 320, 325, 370, 385, 400, 427, 469, 475, 481, 500, 511, 542, 553, 592, 625, 637, 640, 679, 715, 721, 763, 800, 889 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A002275.

Sequence in context: A003253 A119905 A161750 this_sequence A007951 A102338 A139449

Adjacent sequences: A067937 A067938 A067939 this_sequence A067941 A067942 A067943

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research