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

Exponent of 2 modulo the prime A056807(n).
1

%I #11 Jun 29 2017 17:07:08

%S 5,1500,234375,300000000,7500000000000000000000000000,

%T 750000000000000000000000000000000000,

%U 1500000000000000000000000000000000000000000000000000000000000000000

%N Exponent of 2 modulo the prime A056807(n).

%H 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.

%H 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 A259867 := proc(n)

%p p := 3*10^A056807(n)+1 ;

%p numtheory[order](2,p) ;

%p end proc: # _R. J. Mathar_, Jul 15 2015

%Y Cf. A056807.

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Jul 08 2015