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.

A275529 a(n) is the only number m such that 4^(2^m) - 2^(2^m) + 1 is divisible by A275528(n).

This page as a plain text file.
%I A275529 #11 Aug 04 2016 22:37:24
%S A275529 0,1,3,4,2,3,6,10,16,4,13,13,19,23,27,21,15,26,25,28,34,25,22,11,29,
%T A275529 30,13
%N A275529 a(n) is the only number m such that 4^(2^m) - 2^(2^m) + 1 is divisible by A275528(n).
%o A275529 (PARI) forprime(p=3, 10^15, o=znorder(Mod(2, p))/3; x=ispower(2*o); if(p==3||2^(x-1)==o, if(x<2, print1(0, ", "), print1(x-2, ", "))));
%Y A275529 Cf. A275528.
%K A275529 nonn,more
%O A275529 1,3
%A A275529 _Arkadiusz Wesolowski_, Jul 31 2016