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 A276003 #8 Aug 17 2016 22:19:26
%S A276003 9,27,31,32,34,35,37,39,40,41,44,45,51,57,61,63,64,65,68,69,79,81,82,
%T A276003 83,104,105,123,127,128,130,131,133,135,136,137,140,141,145,146,148,
%U A276003 149,150,156,158,162,163,166,167,169,170,172,173,175,176,178,179,180,182,186,187,190,191,193,195,196,197,198,200,205,207,208,209,210,211,212
%N A276003 Numbers n for which A060502(n) = 3; numbers with exactly three occupied slopes in their factorial representation.
%C A276003 Also numbers n such that A060498(n) is a three-ball juggling pattern.
%H A276003 Antti Karttunen, <a href="/A276003/b276003.txt">Table of n, a(n) for n = 1..15620</a>
%H A276003 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>
%F A276003 Other identities. For all n >= 1:
%F A276003 A060130(a(n)) >= 3.
%e A276003 27 ("1011" in factorial base) is included as there are three distinct values attained by the difference digit_position - digit_value when computed for its nonzero digits: 4-1 = 3, 2-1 = 1 and 1-1 = 0.
%e A276003 51 ("2011" in factorial base) is included as there are three distinct values attained by the difference digit_position - digit_value when computed for its nonzero digits: 4-2 = 2, 2-1 = 1 and 1-1 = 0.
%e A276003 57 ("2111" in factorial base) is included as there are three distinct values attained by the difference digit_position - digit_value when computed for its nonzero digits: 4-2 = 3-1 = 2, 2-1 = 1 and 1-1 = 0.
%o A276003 (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o A276003 (define A276003 (MATCHING-POS 1 0 (lambda (n) (= 3 (A060502 n)))))
%Y A276003 Cf. A060130, A060498, A060502, A276001, A276002.
%K A276003 nonn,base
%O A276003 1,1
%A A276003 _Antti Karttunen_, Aug 16 2016