%I #11 Aug 07 2016 22:27:29
%S 5,7,9,10,11,13,17,19,21,22,23,25,28,29,31,33,34,37,41,43,46,47,49,51,
%T 53,55,57,58,59,61,65,67,69,71,73,76,77,79,82,83,85,89,91,93,94,97,99,
%U 101,103,105,106,107,109,111,113,115,118,121,127,129,131,133,134,136,137,139,141,142,145,148,149,151,153,154,155
%N Numbers n for which A003961(n) < A003961(n-1).
%C One more than the positions of descents in permutation A048673.
%H Antti Karttunen, <a href="/A275718/b275718.txt">Table of n, a(n) for n = 1..10000</a>
%t f[n_] := Times @@ Map[Prime[PrimePi@ First[#] + 1]^Last[#] &, FactorInteger@ n]; Select[Range@ 155, f[# - 1] > f@ # &] (* _Michael De Vlieger_, Aug 07 2016 *)
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A275718 (MATCHING-POS 1 2 (lambda (n) (< (A003961 n) (A003961 (- n 1))))))
%Y One more than A275722.
%Y Complement: A275717 (apart from 1 which is in neither sequence).
%Y Cf. A003961, A048673.
%Y Cf. also A275719, A275720, A246281, A246282.
%K nonn
%O 1,1
%A _Antti Karttunen_, Aug 07 2016