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!)
A283715 a(n) is the number of Carmichael numbers whose largest prime factor is prime(n). 1
0, 0, 0, 0, 0, 0, 2, 1, 0, 1, 2, 2, 2, 0, 0, 0, 0, 6, 3, 1, 9, 2, 0, 3, 9, 7, 3, 1, 16, 20, 42, 19, 12, 15, 3, 60, 54, 57, 2, 8, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,7
COMMENTS
Since Carmichael numbers are squarefree, there is only a finite number of them whose largest prime factor is any given prime.
LINKS
EXAMPLE
a(28) = 1 because prime(28) = 107 and there is only one Carmichael number whose largest prime factor is 107, namely 413631505 = 5 * 7 * 17 * 73 * 89 * 107.
MATHEMATICA
a[n_] := a[n] = If[n < 6, 0, Block[{t, p = Prime@ n}, Length@ Select[ Subsets[ Prime@ Range[2, n-1], {2, n-2}], (t = Times @@ #; Mod[t-1, p-1] == 0 && And @@ IntegerQ /@ ((p t - 1)/ (#-1))) &]]]; Array[a, 22]
CROSSREFS
Sequence in context: A027357 A256479 A277078 * A078808 A030363 A236460
KEYWORD
nonn,more
AUTHOR
Giovanni Resta, Mar 15 2017
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 7 18:23 EDT 2024. Contains 373206 sequences. (Running on oeis4.)