Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 Sep 04 2021 05:53:29
%S 348,355,358,383,388,427,448,455,478,479,485,490,491,497,499,508,509,
%T 511,515,520,521,533,535,541,545,547,551,553,556,557,559,560,679,708,
%U 759,765,777,796,807,808,822,828,838,839,847,862,891,906,928,931,933,951
%N Numbers k such that the smallest pseudoprime ( > k ) to base k, A007535(k), is a Carmichael number.
%H Amiram Eldar, <a href="/A293512/b293512.txt">Table of n, a(n) for n = 1..10000</a>
%e 348 is the sequence since A007535(348) = 1105 is a Carmichael number.
%t carmichaelQ[n_] := Divisible[n - 1, CarmichaelLambda[n]] && ! PrimeQ[n];
%t f[n_] := Block[{k = n}, While[GCD[n, k] > 1 || PrimeQ[k] || PowerMod[n, k - 1, k] != 1, j = k++]; k]; Select[Range[1000], carmichaelQ[f[#]] &] (* after _Robert G. Wilson v_ at A090086 *)
%Y Cf. A002997, A007535.
%K nonn
%O 1,1
%A _Amiram Eldar_, Oct 12 2017