|
%I #9 Aug 07 2016 22:27:36
%S 1,2,3,5,7,11,13,14,15,17,19,23,25,26,29,31,34,35,37,38,39,41,43,44,
%T 47,49,51,53,55,59,61,62,63,65,67,69,71,73,74,77,79,80,83,85,86,87,89,
%U 91,94,95,97,99,101,103,107,109,111,113,115,116,118,119,121,122,123,124,125,127,129,131,134,137,139,142,143,145
%N Numbers n for which A003961(n+1) > A003961(n).
%C Positions of the ascents in permutation A048673.
%H Antti Karttunen, <a href="/A275721/b275721.txt">Table of n, a(n) for n = 1..16384</a>
%t f[n_] := Times @@ Map[Prime[PrimePi@ First[#] + 1]^Last[#] &, FactorInteger@ n]; Select[Range@ 145, f@ # < f[# + 1] &] (* _Michael De Vlieger_, Aug 07 2016 *)
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A275721 (MATCHING-POS 1 1 (lambda (n) (> (A003961 (+ 1 n)) (A003961 n)))))
%Y One less than A275717.
%Y Complement: A275722.
%Y Cf. A003961, A048673, A275719.
%K nonn
%O 1,2
%A _Antti Karttunen_, Aug 07 2016
|
