Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013585
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A013585
%S A013585 1,2,0,0,3,4,0,0,5,0,0,12,0,7,19,0,4,0,24,0,32,19,0,0,0,5,20,0,0,0,0,0,
               0,
%T A013585 20,12,0,7,0,0,57,7,0,0,19,0,0,0,0,6,8,83,0,0,15,33,24,0,0,0,0,12,32,0,
               38,
%U A013585 19,9,0,0,0,23,0,0,0,0,70,71,5,0,57,20,0,17,0,0,0,0,26,0,0,0,0,0,0,0,0,
               28
%N A013585 Smallest m such that 1!+...+m! is divisible by 2n+1, or 0 if no such 
               m exists.
%C A013585 Also called Smarandache-Wagstaff numbers.
%D A013585 M. R. Mudge, Smarandache Notions Journal, University of Craiova, Vol. 
               VII, No. 1, 1996.
%H A013585 M. L. Perez et al., eds., <a href="http://www.gallup.unm.edu/~smarandache/
               ">Smarandache Notions Journal</a>
%Y A013585 Cf. A013584.
%Y A013585 Sequence in context: A050186 A074734 A124182 this_sequence A053653 A064146 
               A028590
%Y A013585 Adjacent sequences: A013582 A013583 A013584 this_sequence A013586 A013587 
               A013588
%K A013585 nonn
%O A013585 0,2
%A A013585 Michael R. Mudge (Amsorg(AT)aol.com), additional terms from Allan Wechsler 
               (acw(AT)alum.mit.edu)

    
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 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research