login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112985 2^(2^n mod n-1). 0
1, 4, 1, 1, 2, 1, 16, 4, 16, 1, 128, 256, 16, 256, 16, 256, 2, 1, 16, 4, 16, 4096, 65536, 256, 16, 256, 16384, 256, 33554432, 16, 16, 256, 16, 1, 65536, 256, 2, 1048576, 16, 256, 65536, 4294967296, 16, 4, 16, 4294967296, 17179869184, 256, 16, 4294967296, 2048 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..50.

FORMULA

a(n)=2^A112983(n).

CROSSREFS

Sequence in context: A010324 A016525 A077604 * A073693 A100261 A016526

Adjacent sequences:  A112982 A112983 A112984 * A112986 A112987 A112988

KEYWORD

easy,nonn

AUTHOR

Paul Barry, Oct 08 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 7 11:24 EST 2016. Contains 278874 sequences.