A275529
a(n) is the only number m such that 4^(2^m) - 2^(2^m) + 1 is divisible by A275528(n).
Original entry on oeis.org
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, 30, 13
Offset: 1
-
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, ", "))));
A255771
Number of distinct prime factors of A220294(n).
Original entry on oeis.org
1, 1, 1, 2, 2, 1, 2, 2, 4, 2, 2
Offset: 0
A220294(0) = 3 so a(0) = 1.
A220294(1) = 13 so a(1) = 1.
A220294(2) = 241 so a(2) = 1.
A220294(3) = 97*673 so a(3) = 2.
A220294(4) = 193*22253377 so a(4) = 2.
- Arthur Engel, Problem-Solving Strategies, Springer, 1998, pages 121-122 (E3, said to be a "recent competition problem from the former USSR").
a(9) was found in 2008 by Geoffrey Reynolds. a(10) was found by Anders Björn and Hans Riesel. -
Arkadiusz Wesolowski, Aug 02 2016
Showing 1-2 of 2 results.
Comments