The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A309003 Carmichael numbers divisible by the sum of their prime factors, sopfr (A001414). 1
3240392401, 13577445505, 14446721521, 84127131361, 203340265921, 241420757761, 334797586201, 381334973041, 461912170321, 1838314142785, 3636869821201, 10285271821441, 17624045440981, 18773053896961, 20137015596061, 24811804945201, 26863480687681, 35598629998801 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Intersection of A002997 and A308643.
Intersection of A002997 and A036844.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (calculated using data from Claude Goutier)
EXAMPLE
3240392401 = 29*37*41*73*1009, A001414(3240392401)=1189 = 29*41.
PROG
(PARI) sopfr(f) = f[, 1]~*f[, 2];
isCarmichael(n, f)= bittest(n, 0) && !for(i=1, #f~, (f[i, 2]==1 && n%(f[i, 1]-1)==1)||return) && (#f~>1);
isok(n) = my(f=factor(n)); isCarmichael(n, f) && !(n % sopfr(f)); \\ Michel Marcus, Jul 07 2019
CROSSREFS
Sequence in context: A198298 A074773 A340133 * A348811 A251523 A155961
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 5 14:10 EDT 2024. Contains 373105 sequences. (Running on oeis4.)