Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067939
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A067939
%S A067939 1,2,3,4,5,6,8,10,12,15,16,20,22,24,25,30,32,40,41,42,44,48,50,60,64,
%T A067939 66,75,78,80,84,88,96,100,102,110,111,114,120,125,132,138,150,156,160,
%U A067939 168,174,176,186,192,200,202,210,220,222,240,246,250,258,264,271,282
%N A067939 Let rep(n) be the n-th repunit number; sequence gives values of n such 
               that rep(n) == rep(6) (mod n).
%Y A067939 Cf. A002275.
%Y A067939 Sequence in context: A078931 A003401 A064481 this_sequence A067784 A018744 
               A018478
%Y A067939 Adjacent sequences: A067936 A067937 A067938 this_sequence A067940 A067941 
               A067942
%K A067939 easy,nonn
%O A067939 1,2
%A A067939 Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 05 2002

    
page 1

Search completed in 0.001 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 December 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research