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 A266399 #10 Jan 19 2016 23:48:30 %S A266399 5,9,10,17,18,19,22,33,34,35,36,39,40,43,49,65,66,67,68,69,72,73,74, %T A266399 77,78,81,87,88,91,97,107,129,130,131,132,133,134,137,138,139,140,143, %U A266399 144,145,148,149,152,158,159,160,163,164,167,173,174,177,183,193,194,197,203,213,228,257,258,259,260,261 %N A266399 a(n) = A188163(A088359(n)); positions where A004001 obtains unique values. %C A266399 Numbers n for which A004001(n-1) < A004001(n) < A004001(n+1). %H A266399 Antti Karttunen, <a href="/A266399/b266399.txt">Table of n, a(n) for n = 1..8192</a> %F A266399 a(n) = A188163(A088359(n)) = A088359(A088359(n)-1) = A188163(A188163(1+n)). %F A266399 Other identities. For all n >= 1: %F A266399 A004001(a(n)) = A088359(n). %o A266399 (Scheme, two variants) %o A266399 (define (A266399 n) (A088359 (- (A088359 n) 1))) %o A266399 (define A266399 (MATCHING-POS 1 2 (lambda (n) (< (A004001 (- n 1)) (A004001 n) (A004001 (+ n 1)))))) ;; This one requires _Antti Karttunen_'s IntSeq-library %Y A266399 Cf. A004001. %Y A266399 Subsequence of A088359 and A188163. %Y A266399 Cf. also A266188. %K A266399 nonn %O A266399 1,1 %A A266399 _Antti Karttunen_, Jan 18 2016