|
%I #23 Apr 05 2020 05:03:06
%S 105,165,195,231,255,273,285,315,345,357,385,399,429,435,455,465,483,
%T 495,525,555,561,585,595,609,615,627,645,651,663,665,693,705,715,735,
%U 741,759,765,777,795,805,819,825,855,861,885,897,903,915,935,945,957,969
%N Odd numbers with at least 3 distinct prime factors.
%C If "at least" is changed to "exactly" we get A278569. - _N. J. A. Sloane_, Nov 27 2016
%H Alois P. Heinz, <a href="/A216918/b216918.txt">Table of n, a(n) for n = 1..10000</a>
%H J. B. Cosgrave, K. Dilcher, <a href="http://www.emis.de/journals/INTEGERS/papers/i39/i39.Abstract.html"> Extensions of the Gauss-Wilson Theorem</a>, Integers: Electronic Journal of Combinatorial Number Theory, 8 (2008), p.11.
%F Gauss_factorial(floor(a(n)/2), a(n)) == 1 (mod a(n)). (Cf. A216919)
%p a:= proc(n) option remember; local k;
%p for k from 2+ `if`(n=1, 103, a(n-1)) by 2
%p while nops(numtheory[factorset](k))<=2 do od; k
%p end:
%p seq (a(n), n=1..100); # _Alois P. Heinz_, Oct 03 2012
%t Select[Range[1, 999, 2], (PrimeNu[#] >= 3)&] (* _Jean-François Alcover_, Feb 27 2014 *)
%o (Sage)
%o def is_A216918(n):
%o if n % 2 == 0: return False
%o return len(n.prime_divisors()) >= 3
%o def A216918_list(n): return [k for k in srange(1, n + 1, 2) if is_A216918(k)]
%o A216918_list(969)
%Y A278569 is a subsequence.
%K nonn
%O 1,1
%A _Peter Luschny_, Oct 02 2012
|
