Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,2

CROSSREFS

Cf. A002275.

Sequence in context: A089653 A114652 A067943 this_sequence A003592 A159765 A018653

Adjacent sequences: A067934 A067935 A067936 this_sequence A067938 A067939 A067940

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research