Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067942
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067942 Let rep(n) be the n-th repunit number; sequence gives values of n such that rep(n) == rep(9) (mod n). +0
1
1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 15, 16, 18, 20, 21, 24, 25, 30, 32, 33, 36, 39, 40, 45, 48, 50, 55, 60, 63, 64, 72, 73, 75, 80, 90, 96, 99, 100, 101, 105, 111, 117, 120, 125, 128, 137, 144, 150, 153, 160, 164, 165, 171, 180, 192, 195, 200, 207, 222, 225, 231, 240 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A002275.

Sequence in context: A059519 A163101 A157465 this_sequence A130176 A156541 A031143

Adjacent sequences: A067939 A067940 A067941 this_sequence A067943 A067944 A067945

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 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research