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”).

A233442
2^n mod n^3.
2
0, 4, 8, 16, 32, 64, 128, 256, 512, 24, 717, 640, 1601, 2664, 2393, 0, 3334, 5536, 3004, 576, 4166, 9640, 5545, 8704, 7557, 3696, 19034, 6400, 20244, 5824, 29204, 0, 21293, 12176, 13493, 40960, 41146, 25008, 16154, 11776, 55680, 56008, 20642, 79040, 14957, 1016
OFFSET
1,2
FORMULA
a(n) = A000079(n) mod A000578(n).
PROG
(Python)
for n in range(1, 100): print str(2**n % n**3)+', ',
CROSSREFS
KEYWORD
nonn
AUTHOR
Alex Ratushnyak, Dec 09 2013
STATUS
approved