Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A092679

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Numbers k such that 3*2^k has only one anti-divisor.
(history; published version)
#22 by Alois P. Heinz at Tue Jan 04 21:40:17 EST 2022
STATUS

proposed

approved

#21 by Jon E. Schoenfield at Tue Jan 04 20:11:17 EST 2022
STATUS

editing

proposed

#20 by Jon E. Schoenfield at Tue Jan 04 20:11:05 EST 2022
KEYWORD

more,nonn

nonn,hard,more

STATUS

approved

editing

Discussion
Tue Jan 04
20:11
Jon E. Schoenfield: Okay?
#19 by Alois P. Heinz at Sun Jun 20 19:18:09 EDT 2021
STATUS

editing

approved

#18 by Alois P. Heinz at Sun Jun 20 19:17:01 EDT 2021
LINKS

Jon Perry, <a href="http://www.users.globalnet.co.uk/~perry/maths/uniqueantidivisor.htm#antiprime">Anti-Primes</a>.

STATUS

proposed

editing

#17 by Jon E. Schoenfield at Sun Jun 20 18:17:01 EDT 2021
STATUS

editing

proposed

#16 by Jon E. Schoenfield at Sun Jun 20 18:16:50 EDT 2021
NAME

Numbers n k such that 3*2^n k has only one anti-divisor.

STATUS

approved

editing

Discussion
Sun Jun 20
18:17
Jon E. Schoenfield: Is the link broken?
#15 by N. J. A. Sloane at Sat Dec 07 12:33:53 EST 2019
PROG

A092679 = [i for i, n in enumerate(map(lambda x:3*2**x, xrangerange(20))) if len([d for d in range(2, n, 2) if n%d and not 2*n%d]+[d for d in range(3, n, 2) if n%d and 2*n%d in [d-1, 1]])==1] # Chai Wah Wu, Aug 09 2014

Discussion
Sat Dec 07
12:33
OEIS Server: https://oeis.org/edit/global/2838
#14 by N. J. A. Sloane at Sat Dec 07 12:18:24 EST 2019
PROG

A092679 = [i for i, n in enumerate(map(lambda x:3*2**x, xrange(20))) if len([d for d in xrangerange(2, n, 2) if n%d and not 2*n%d]+[d for d in xrangerange(3, n, 2) if n%d and 2*n%d in [d-1, 1]])==1] # Chai Wah Wu, Aug 09 2014

Discussion
Sat Dec 07
12:18
OEIS Server: https://oeis.org/edit/global/2837
#13 by Bruno Berselli at Wed Aug 13 09:32:05 EDT 2014
STATUS

reviewed

approved