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 A263262 #7 Nov 09 2015 16:08:43 %S A263262 3,4,11,14,32,44,48,81,86,88,116,130,135,175,184,186,192,200,244,246, %T A263262 252,262,266,284,286,296,320,326,336,365,370,376,378,380,384,404,406, %U A263262 428,430,460,482,490,524,529,534,608,624,642,652,654,656,682,690,764,768,772,786,794,796,802,806,810,884,888 %N A263262 Row 2 of A263255. %C A263262 Numbers n for which A263254(n) = 2. Numbers that are two edges removed from the infinite trunk (A259934) of the tree defined by edge-relation A049820(child) = parent. %H A263262 Antti Karttunen, <a href="/A263262/b263262.txt">Table of n, a(n) for n = 1..9096</a> %o A263262 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A263262 (define A263262 (MATCHING-POS 1 0 (lambda (n) (= 2 (A263254 n))))) %Y A263262 Cf. A049820, A259934, A263254, A263255. %K A263262 nonn %O A263262 1,1 %A A263262 _Antti Karttunen_, Nov 07 2015