cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A233442 a(n) = 2^n mod n^3.

This page as a plain text file.
%I A233442 #17 Mar 27 2025 06:11:17
%S A233442 0,4,8,16,32,64,128,256,512,24,717,640,1601,2664,2393,0,3334,5536,
%T A233442 3004,576,4166,9640,5545,8704,7557,3696,19034,6400,20244,5824,29204,0,
%U A233442 21293,12176,13493,40960,41146,25008,16154,11776,55680,56008,20642,79040,14957,1016
%N A233442 a(n) = 2^n mod n^3.
%H A233442 Paolo Xausa, <a href="/A233442/b233442.txt">Table of n, a(n) for n = 1..10000</a>
%F A233442 a(n) = A000079(n) mod A000578(n).
%t A233442 Array[PowerMod[2, #, #^3] &, 50] (* _Paolo Xausa_, Mar 27 2025 *)
%o A233442 (Python)
%o A233442 for n in range(1,100):  print(2**n % n**3, end=', ')
%Y A233442 Cf. A000079, A000578, A066606, A066607.
%Y A233442 Cf. A233441, A233471.
%K A233442 nonn
%O A233442 1,2
%A A233442 _Alex Ratushnyak_, Dec 09 2013