This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A275717 #13 Aug 07 2016 22:27:22 %S A275717 2,3,4,6,8,12,14,15,16,18,20,24,26,27,30,32,35,36,38,39,40,42,44,45, %T A275717 48,50,52,54,56,60,62,63,64,66,68,70,72,74,75,78,80,81,84,86,87,88,90, %U A275717 92,95,96,98,100,102,104,108,110,112,114,116,117,119,120,122,123,124,125,126,128,130,132,135,138,140,143,144 %N A275717 Numbers n for which A003961(n) > A003961(n-1). %C A275717 One more than the positions of ascents in permutation A048673. %H A275717 Antti Karttunen, <a href="/A275717/b275717.txt">Table of n, a(n) for n = 1..10000</a> %t A275717 f[n_] := Times @@ Map[Prime[PrimePi@ First[#] + 1]^Last[#] &, FactorInteger@ n]; Select[Range@ 145, f[# - 1] < f@ # &] (* _Michael De Vlieger_, Aug 07 2016 *) %o A275717 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A275717 (define A275717 (MATCHING-POS 1 2 (lambda (n) (> (A003961 n) (A003961 (- n 1)))))) %Y A275717 One more than A275721. %Y A275717 Cf. A003961, A048673. %Y A275717 Complement: A275718 (apart from 1 which is in neither sequence). %Y A275717 Cf. A029744 (a subsequence, apart from its initial 1). %Y A275717 Cf. also A275719, A275720, A246281, A246282. %K A275717 nonn %O A275717 1,1 %A A275717 _Antti Karttunen_, Aug 07 2016