The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A225498 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A225498

Weak Carmichael numbers.
(history; published version)

#40 by OEIS Server at Thu Aug 17 08:16:58 EDT 2023

LINKS

Amiram Eldar, <a href="/A225498/b225498_1.txt">Table of n, a(n) for n = 1..10000</a>

#39 by Michael De Vlieger at Thu Aug 17 08:16:58 EDT 2023

STATUS

reviewed

approved

Discussion

Thu Aug 17

08:16

OEIS Server: Installed new b-file as b225498.txt.  Old b-file is now b225498_1.txt.

#38 by Joerg Arndt at Thu Aug 17 03:33:06 EDT 2023

STATUS

proposed

reviewed

#37 by Amiram Eldar at Thu Aug 17 03:26:48 EDT 2023

STATUS

editing

proposed

#36 by Amiram Eldar at Thu Aug 17 03:09:29 EDT 2023

LINKS

Amiram Eldar, <a href="/A225498/b225498_1.txt">Table of n, a(n) for n = 1..100010000</a>

STATUS

approved

editing

#35 by Michel Marcus at Tue Feb 11 01:04:55 EST 2020

STATUS

reviewed

approved

#34 by Joerg Arndt at Tue Feb 11 00:59:50 EST 2020

STATUS

proposed

reviewed

#33 by Jon E. Schoenfield at Tue Feb 11 00:58:04 EST 2020

STATUS

editing

proposed

#32 by Jon E. Schoenfield at Tue Feb 11 00:58:02 EST 2020

COMMENTS

An odd composite number n > 1 is a weak Carmichael number iff the prime factors of n are a subset of the prime factors of Clausen(n-1,1) (c.fcf. A160014). If additionally n divides Clausen(n-1,1) then n is a Carmichael number. - Peter Luschny, May 21 2019

STATUS

approved

editing

#31 by Alois P. Heinz at Thu Jun 27 17:49:27 EDT 2019

STATUS

reviewed

approved