Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067943
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067943 Let rep(n) be the n-th repunit number, sequence gives values of n such that rep(n)==rep(10) (mod n). +0
1
1, 2, 4, 5, 8, 10, 16, 20, 22, 25, 28, 32, 37, 40, 44, 50, 52, 64, 70, 80, 88, 100, 110, 112, 125, 128, 130, 146, 148, 154, 160, 170, 176, 190, 200, 202, 205, 208, 220, 230, 250, 256, 274, 280, 286, 290, 310, 320, 352, 364, 370, 400, 410, 430, 440, 442, 448, 470 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A002275.

Sequence in context: A126684 A089653 A114652 this_sequence A067937 A003592 A159765

Adjacent sequences: A067940 A067941 A067942 this_sequence A067944 A067945 A067946

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