Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082887
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A082887
%S A082887 1,2,2,8,8,16,16,128,384,256,256,3072,1024,2048,2048,32768,98304,65536,
%T A082887 65536,262144,262144,524288,524288,4194304,4194304,8388608,8388608,
%U A082887 33554432,33554432,67108864,67108864,2147483648,6442450944,4294967296
%N A082887 a(n)=gcd[mod[n!,2^n],mod[(n+1)!,2^(n+1)]].
%e A082887 n=12:mod[12!,4096,]=mod[13!,8192]=3072, gcd[3072,3072]=3072=a(12).
%t A082887 Table[GCD[Mod[w!, 2^w], Mod[(w+1)!, 2^(w+1)]], {w, 1, 50}]
%Y A082887 Sequence in context: A058524 A072576 A060818 this_sequence A137583 A099328 
               A073090
%Y A082887 Adjacent sequences: A082884 A082885 A082886 this_sequence A082888 A082889 
               A082890
%K A082887 easy,nonn
%O A082887 0,2
%A A082887 Labos E. (labos(AT)ana.sote.hu), Apr 22 2003

    
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 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research