%I #13 Aug 17 2016 22:19:10
%S 0,1,2,4,5,6,12,14,18,19,22,23,24,48,54,72,74,84,86,96,97,100,101,114,
%T 115,118,119,120,240,264,360,366,408,414,480,482,492,494,552,554,564,
%U 566,600,601,604,605,618,619,622,623,696,697,700,701,714,715,718,719,720,1440,1560,2160,2184,2400,2424,2880,2886,2928,2934,3240,3246,3288,3294
%N Numbers n for which A060502(n) <= 1; numbers with at most one distinct slope in their factorial representation.
%C Indexing starts from zero, because a(0)=0 is a special case in this sequence. To get those n for which A060502(n) = 1, start listing terms from a(1) = 1 onward.
%C From n=1 onward numbers in whose factorial base representation (A007623) the difference i_x - d_x is the same for all nonzero digits d_x present. Here i_x is the position of digit d_x from the least significant end.
%C From n=1 onward also n such that A060498(n) is a one-ball juggling pattern.
%H <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>
%e 4 ("20" in factorial base) is present, because all nonzero digits are on the same slope as there is only one nonzero digit.
%e 14 ("210" in factorial base) is present, because all nonzero digits are on the same slope, as 3-2 = 2-1.
%e 19 ("301" in factorial base) is present, because all nonzero digits are on the same slope, as 3-3 = 1-1.
%e 21 ("311" in factorial base) is NOT present, because not all of its nonzero digits are on the same slope, as 3-3 <> 2-1.
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A276001 (MATCHING-POS 0 0 (lambda (n) (>= 1 (A060502 n)))))
%Y Cf. A007623, A060498, A060502, A276002, A276003.
%Y Cf. A000142, A033312, A051683 (subsequences).
%K nonn,base
%O 0,3
%A _Antti Karttunen_, Aug 16 2016
|