login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A180060
a(n) = 2^(2^n mod n) mod n.
2
0, 1, 1, 1, 4, 4, 4, 1, 4, 6, 4, 4, 4, 2, 1, 1, 4, 16, 4, 16, 4, 16, 4, 16, 3, 16, 13, 16, 4, 16, 4, 1, 25, 16, 29, 16, 4, 16, 22, 16, 4, 16, 4, 20, 32, 16, 4, 16, 22, 16, 1, 16, 4, 52, 8, 32, 28, 16, 4, 16, 4, 16, 4, 1, 61, 16, 4, 52, 49, 46, 4, 16, 4, 16, 31, 24, 36, 16, 4, 16
OFFSET
1,5
LINKS
FORMULA
a(n) = 2^A015910(n) mod n.
MATHEMATICA
Table[Mod[2^(Mod[2^n, n]), n], {n, 50}] (* Alonso del Arte, Jan 14 2011 *)
Table[PowerMod[2, PowerMod[2, n, n], n], {n, 80}] (* Harvey P. Dale, Oct 09 2019 *)
CROSSREFS
Sequence in context: A172088 A159891 A201941 * A220668 A109610 A067395
KEYWORD
nonn
AUTHOR
EXTENSIONS
Entries corrected by R. J. Mathar, Jan 14 2011
STATUS
approved