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
A082887 a(n)=gcd[mod[n!,2^n],mod[(n+1)!,2^(n+1)]]. +0
1
1, 2, 2, 8, 8, 16, 16, 128, 384, 256, 256, 3072, 1024, 2048, 2048, 32768, 98304, 65536, 65536, 262144, 262144, 524288, 524288, 4194304, 4194304, 8388608, 8388608, 33554432, 33554432, 67108864, 67108864, 2147483648, 6442450944, 4294967296 (list; graph; listen)
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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research