Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Jun 10 2013 04:34:13
%S 1,1,4,2,5,8,9,5,8,11,12,15,16,17,18,12,15,18,19,22,23,24,25,28,29,30,
%T 31,32,33,34,35,27,30,33,34,37,38,39,40,43,44,45,46,47,48,49,50,53,54,
%U 55,56,57,58,59,60,61,62,63,64,65,66,67,68,58,61,64,65
%N D(n,2^n), where D is the binary graph metric, as in A226456.
%C See A226456.
%H Clark Kimberling, <a href="/A226457/b226457.txt">Table of n, a(n) for n = 1..1000</a>
%e Using Method 1:
%e D(1,2) = 1 + 2 - 2*1 = 1.
%e D(2,4) = 2 + 3 - 2*2 = 1
%e D(3,8) = 2 + 4 - 2*1 = 4
%t r = 1/2; f[x_] := Floor[r*x]; z = 20; g[x_] := FixedPointList[f, x]; u[x_] := Length[g[x]]; v[x_, y_] := Max[Intersection[g[x], g[y]]]; d[x_, y_] := u[x] + u[y] - 2*Length[g[v[x, y]]]; Table[d[n, n + 1], {n, 1, 100}]
%Y Cf. A226246.
%K nonn,base,easy
%O 1,3
%A _Clark Kimberling_, Jun 08 2013