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 A283766 #11 Mar 17 2017 22:03:57 %S A283766 1,2,6,7,11,12,13,16,17,18,21,22,23,27,28,32,33,34,37,38,39,42,43,44, %T A283766 48,49,53,54,58,59,60,63,64,65,69,70,74,75,79,80,81,84,85,86,90,91,95, %U A283766 96,100,101,102,105,106,107,110,111,112,116,117,121,122,123 %N A283766 Numbers k such that L(k) is odd, where L = A000201 = lower Wythoff sequence. %C A283766 Complement of A283765. %H A283766 Clark Kimberling, <a href="/A283766/b283766.txt">Table of n, a(n) for n = 1..10000</a> %F A283766 a(n+1) - a(n) is in {1,3,4} for every n. %F A283766 A085003(a(n)) = n for all n >= 1. - _Antti Karttunen_, Mar 17 2017 %t A283766 r = GoldenRatio; z = 250; t = Table[Floor[n*r], {n, 1, z}]; u = Mod[t, 2]; %t A283766 Flatten[Position[u, 0]] (* A283765 *) %t A283766 Flatten[Position[u, 1]] (* A283766 *) %o A283766 (Scheme, with Antti Karttunen's IntSeq-library) %o A283766 (define A283766 (MATCHING-POS 1 1 (lambda (n) (odd? (A105774 n))))) %o A283766 ;; _Antti Karttunen_, Mar 17 2017 %Y A283766 Cf. A000201, A001622, A105774, A283765, A283768. %Y A283766 Cf. A085002 (characteristic function), A085003 (a left inverse). %K A283766 nonn,easy %O A283766 1,2 %A A283766 _Clark Kimberling_, Mar 17 2017