cp's OEIS Frontend

A191362 Number of the diagonal of the dispersion of the even positive integers that contains n.

%I A191362 #6 Mar 30 2012 18:57:32
%S A191362 0,-1,1,-2,2,0,3,-3,4,1,5,-1,6,2,7,-4,8,3,9,0,10,4,11,-2,12,5,13,1,14,
%T A191362 6,15,-5,16,7,17,2,18,8,19,-1,20,9,21,3,22,10,23,-3,24,11,25,4,26,12,
%U A191362 27,0,28,13,29,5,30,14,31,-6,32,15,33,6,34,16,35,1,36,17,37,7,38,18,39,-2,40,19,41,8,42,20,43,2,44,21,45,9,46,22,47,-4,48,23,49,10
%N A191362 Number of the diagonal of the dispersion of the even positive integers that contains n.
%C A191362 Every integer occurs in A191362 (infinitely many times).
%C A191362 Represent the array as {f(i,j): i>=1, j>=1}.  Then for m>=0, (diagonal #m) is the sequence (f(i,i+m)), i>=1;
%C A191362 for m<0, (diagonal #m) is the sequence (f(i+m,i)), i>=1.
%t A191362 f[i_, j_] := (2 j - 1)*2^(i - 1);
%t A191362 t=TableForm[Table[f[i, j], {i, 1, 10}, {j, 1, 8}]]
%t A191362 (* t=A054582, the dispersion of the even positive integers *)
%t A191362 a = Flatten[Table[If[f[i, j] == n, j - i, {}], {n, 100}, {i, 10}, {j, 80}]]
%t A191362 (* a=A191362 *)
%Y A191362 Cf. A191362, A114327, A191360, A191361.
%K A191362 sign
%O A191362 1,4
%A A191362 _Clark Kimberling_, May 31 2011