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 A247282 #25 Feb 04 2022 11:19:05 %S A247282 1,1,1,3,1,1,3,5,1,1,1,3,3,3,5,15,1,1,1,3,1,1,3,5,3,3,3,9,5,5,15,17,1, %T A247282 1,1,3,1,1,3,5,1,1,1,3,3,3,5,15,3,3,3,9,3,3,9,15,5,5,5,15,15,15,17,51, %U A247282 1,1,1,3,1,1,3,5,1,1,1,3,3,3,5,15,1,1,1,3,1,1,3,5,3,3,3,9,5,5,15,17,3,3,3,9,3,3,9,15,3,3,3,9,9,9,15,45 %N A247282 Run Length Transform of A001317. %C A247282 The Run Length Transform of a sequence {S(n), n>=0} is defined to be the sequence {T(n), n>=0} given by T(n) = Product_i S(i), where i runs through the lengths of runs of 1's in the binary expansion of n. E.g. 19 is 10011 in binary, which has two runs of 1's, of lengths 1 and 2. So T(19) = S(1)*S(2). T(0)=1 (the empty product). %C A247282 This sequence is obtained by applying Run Length Transform to the right-shifted version of the sequence A001317: 1, 3, 5, 15, 17, 51, 85, 255, 257, ... %H A247282 Antti Karttunen, <a href="/A247282/b247282.txt">Table of n, a(n) for n = 0..8192</a> %F A247282 For all n >= 0, a(A051179(n)) = A246674(A051179(n)) = A051179(n). %e A247282 115 is '1110011' in binary. The run lengths of 1-runs are 2 and 3, thus a(115) = A001317(2-1) * A001317(3-1) = 3*5 = 15. %e A247282 From _Omar E. Pol_, Feb 15 2015: (Start) %e A247282 Written as an irregular triangle in which row lengths are the terms of A011782: %e A247282 1; %e A247282 1; %e A247282 1,3; %e A247282 1,1,3,5; %e A247282 1,1,1,3,3,3,5,15; %e A247282 1,1,1,3,1,1,3,5,3,3,3,9,5,5,15,17; %e A247282 1,1,1,3,1,1,3,5,1,1,1,3,3,3,5,15,3,3,3,9,3,3,9,15,5,5,5,15,15,15,17,51; %e A247282 ... %e A247282 Right border gives 1 together with A001317. %e A247282 (End) %t A247282 a1317[n_] := FromDigits[ Table[ Mod[Binomial[n-1, k], 2], {k, 0, n-1}], 2]; %t A247282 Table[ Times @@ (a1317[Length[#]]&) /@ Select[Split[IntegerDigits[n, 2]], #[[1]] == 1&], {n, 0, 100}] (* _Jean-François Alcover_, Jul 11 2017 *) %o A247282 (MIT/GNU Scheme) %o A247282 (define (A247282 n) (fold-left (lambda (a r) (* a (A001317 (- r 1)))) 1 (bisect (reverse (binexp->runcount1list n)) (- 1 (modulo n 2))))) %o A247282 ;; Other functions as in A227349. %o A247282 (Python) %o A247282 # uses RLT function from A278159 %o A247282 def A247282(n): return RLT(n,lambda m: int(''.join(str(int(not(~(m-1)&k))) for k in range(m)),2)) # _Chai Wah Wu_, Feb 04 2022 %Y A247282 Cf. A003714 (gives the positions of ones). %Y A247282 Cf. A001317, A051179. %Y A247282 A001316 is obtained when the same transformation is applied to A000079, the powers of two. %Y A247282 Run Length Transforms of other sequences: A071053, A227349, A246588, A246595, A246596, A246660, A246661, A246674, A246685. %K A247282 nonn %O A247282 0,4 %A A247282 _Antti Karttunen_, Sep 22 2014