Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067941
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A067941
%S A067941 1,2,4,5,8,10,14,16,20,22,25,26,32,40,44,50,56,64,74,80,88,100,104,110,
%T A067941 125,128,136,140,152,160,176,182,184,185,200,220,224,232,239,248,250,
%U A067941 256,260,296,308,320,328,344,350,352,376,400,404,416,424,440,472,488
%N A067941 Let rep(n) be the n-th repunit number, sequence gives values of n such 
               that rep(n)==rep(8) (mod n).
%Y A067941 Cf. A002275.
%Y A067941 Sequence in context: A036404 A018498 A002048 this_sequence A092265 A163295 
               A101274
%Y A067941 Adjacent sequences: A067938 A067939 A067940 this_sequence A067942 A067943 
               A067944
%K A067941 easy,nonn
%O A067941 1,2
%A A067941 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research