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 A262903 #12 Oct 11 2015 10:54:11 %S A262903 4,5,14,16,32,41,44,77,80,92,101,110,119,128,139,148,158,161,169,176, %T A262903 191,192,199,215,224,227,234,238,249,262,264,277,296,311,317,327,350, %U A262903 351,352,360,363,382,385,389,392,395,396,411,427,430,437,448,449,461,464,483,488,518,523,531,532,542,552,561,568,570,577,579,600,601,613,619,632,634,636,645,648,659,665,666,671,682,683,696,705,723 %N A262903 Numbers that are not leaves but all of whose children are leaves in the tree generated by edge-relation A049820(child) = parent. %C A262903 Numbers n for which A060990(n) > 0 and A060990(n) = A262900(n). %C A262903 Numbers n for which A262695(n) = 2. %H A262903 Antti Karttunen, <a href="/A262903/b262903.txt">Table of n, a(n) for n = 1..10000</a> %o A262903 (Scheme, with _Antti Karttunen_'s IntSeq-library, two variant definitions) %o A262903 (define A262903 (MATCHING-POS 1 0 (lambda (n) (and (not (zero? (A060990 n))) (= (A060990 n) (A262900 n)))))) %o A262903 (define A262903 (MATCHING-POS 1 0 (lambda (n) (= 2 (A262695 n))))) %Y A262903 Cf. A000005, A049820, A060990, A262695, A262900. %Y A262903 Subsequence of A262901 and A236562. %Y A262903 No common terms with A259934. %Y A262903 Cf. also A257512. %K A262903 nonn %O A262903 1,1 %A A262903 _Antti Karttunen_, Oct 06 2015