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 A267103 #6 Jan 24 2016 23:48:00 %S A267103 4,15,27,30,48,54,57,61,86,96,102,105,112,115,119,124,157,172,182,188, %T A267103 191,202,208,211,218,221,225,233,236,240,245,251,293,314,329,339,345, %U A267103 348,364,374,380,383,394,400,403,410,413,417,429,435,438,445,448,452,460,463,467,472,481,484,488,493,499,506,558 %N A267103 Row 3 of A265903; numbers that occur exactly three times in A004001. %C A267103 Numbers n for which A051135(n) = 3. %H A267103 Antti Karttunen, <a href="/A267103/b267103.txt">Table of n, a(n) for n = 1..8192</a> %F A267103 a(n) = A087686(1+A266109(n)) = A087686(1+A087686(1+A188163(n))). %o A267103 (Scheme, two implementations, the latter requiring also Antti Karttunen's IntSeq-library) %o A267103 (define (A267103 n) (A087686 (+ 1 (A266109 n)))) %o A267103 (define A267103 (MATCHING-POS 1 1 (lambda (n) (= 3 (A051135 n))))) %Y A267103 Column 3 of A265901, row 3 of A265903. %Y A267103 Cf. A004001, A051135, A087686, A188163, A266109. %K A267103 nonn %O A267103 1,1 %A A267103 _Antti Karttunen_, Jan 18 2016