Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015940
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A015940
%S A015940 1,5,917,3223,62911,326329,395819,33504053,4446226763
%N A015940 Numbers n such that n | 2^n + 3.
%t A015940 Do[ If[ PowerMod[ 2, n, n ] + 3 == n, Print[n]], { n, 1, 10^9, 2 } ]
%Y A015940 Cf. A050259.
%Y A015940 Sequence in context: A085706 A135084 A094630 this_sequence A093853 A157332 
               A024072
%Y A015940 Adjacent sequences: A015937 A015938 A015939 this_sequence A015941 A015942 
               A015943
%K A015940 nonn
%O A015940 1,2
%A A015940 Robert G. Wilson v (rgwv(AT)rgwv.com)
%E A015940 Corrected and extended by Olivier Wittenberg, May 23 2004. No other terms 
               below 10^10.

    
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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research