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.

A259865 Exponent of 2 modulo the prime A039687(n).

This page as a plain text file.
%I A259865 #10 Jun 29 2017 17:05:17
%S A259865 3,12,48,96,384,6144,393216,805306368,103079215104,549755813888,
%T A259865 110680464442257309696,
%U A259865 1176956575385002643219210516851437453019191645837006471168
%N A259865 Exponent of 2 modulo the prime A039687(n).
%C A259865 Here we corrected a(10) which was 1649267441664 in Golomb's article. - _R. J. Mathar_, Jul 14 2015
%H A259865 S. W. Golomb, <a href="http://www.jstor.org/stable/2005337">Properties of the sequence 3.2^n+1</a>, Math. Comp., 30 (1976), 657-663. <a href="http://dx.doi.org/10.1090/S0025-5718-1976-0404129-8">[DOI]</a>
%H A259865 S. W. Golomb, <a href="/A004119/a004119.pdf">Properties of the sequence 3.2^n+1</a>, Math. Comp., 30 (1976), 657-663. [Annotated scanned copy]
%p A259865 A259865 := proc(n)
%p A259865     numtheory[order](2,A039687(n)) ;
%p A259865 end proc: # _R. J. Mathar_, Jul 14 2015
%Y A259865 Cf. A039687.
%K A259865 nonn,more
%O A259865 1,1
%A A259865 _N. J. A. Sloane_, Jul 08 2015