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 A262901 #12 Oct 11 2015 10:52:54 %S A262901 4,5,11,14,16,17,22,27,29,32,35,41,44,46,48,51,57,58,62,65,69,70,77, %T A262901 80,81,91,92,96,101,102,107,110,111,114,118,119,120,128,129,130,138, %U A262901 139,141,144,147,148,152,155,158,161,162,165,166,169,176,181,187,191,192,199,201,214,215,216,222,224,227,231,234,238,239,247,248,249,255,258,262,264,269,277,278,282,286,291,294,296 %N A262901 Numbers that have at least one leaf-child in the tree generated by edge-relation A049820(child) = parent. %C A262901 Positions of nonzeros in A262900. %C A262901 Numbers n such that there is at least one k such that k - d(k) = n [where d(k) is the number of divisors of k, A000005(k)], but there is no such x that x - d(x) = k, in other words, k is one of the terms of A045765. %C A262901 Sequence A262902 sorted into ascending order, with duplicates removed. %H A262901 Antti Karttunen, <a href="/A262901/b262901.txt">Table of n, a(n) for n = 1..10000</a> %o A262901 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A262901 (define A262901 (NONZERO-POS 1 0 A262900)) %Y A262901 Cf. A000005, A045765, A049820, A262900, A262902. %Y A262901 Cf. A262903 (a subsequence). %Y A262901 Subsequence of A236562. %Y A262901 Cf. also A257508. %K A262901 nonn %O A262901 1,1 %A A262901 _Antti Karttunen_, Oct 06 2015