Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066676
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A066676
%S A066676 3,7,31,211,2311,60653,1023053,19417793
%N A066676 Smallest number m such that Phi[m] is a multiple of n-th primorial number, 
               the product of first n primes.
%F A066676 a[n] = Min{x : Mod[A000010(x), A002110(n)] = 0}
%e A066676 n = 8: a[8] = 19417793, Phi[a(8)] = 19199380 = 2*9699690 = 2*2*3*5*7*11*13*17*19.
%Y A066676 Cf. A000010, A002110, A066674-A066678.
%Y A066676 Sequence in context: A083772 A093441 A087864 this_sequence A073917 A030521 
               A105767
%Y A066676 Adjacent sequences: A066673 A066674 A066675 this_sequence A066677 A066678 
               A066679
%K A066676 nonn
%O A066676 1,1
%A A066676 Labos E. (labos(AT)ana.sote.hu), Dec 19 2001

    
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 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research