Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133863
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A133863
%S A133863 40961,19131877,2441406251,115385868869,138090848575723,358661570404751,
%T A133863 44510586506850631,252317900773542353,4465433274456775633,
%U A133863 39171440762351329829,11887418854442931407,14582408526413537791
%N A133863 Smallest odd prime base q such that p^13 divides q^(p-1) - 1, where p 
               = Prime[n].
%e A133863 a(1) = A035089(13) = 40961.
%t A133863 Do[ k = 1; While[ !PowerMod[ Prime[ k ], Prime[ n ] - 1, Prime[ n ]^13 
               ] == 1, k++ ]; Print[ { n, Prime[ k ] } ], {n, 1, 100} ]
%Y A133863 Cf. A035089, A125609, A125610, A125611, A125612, A125632, A125633, A125634, 
               A125635, A125636, A125637, A125645, A125646, A125647, A125648, A125649, 
               A133859, A133860, A133861, A133862, A133864, A133865.
%Y A133863 Sequence in context: A046180 A164648 A097479 this_sequence A033532 A047828 
               A141711
%Y A133863 Adjacent sequences: A133860 A133861 A133862 this_sequence A133864 A133865 
               A133866
%K A133863 nonn
%O A133863 1,1
%A A133863 Alexander Adamchuk (alex(AT)kolmogorov.com), Sep 26 2007
%E A133863 Extended by Max Alekseyev (maxale(AT)gmail.com), May 08 2009

    
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 December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research