cp's OEIS Frontend

A065158 Table of reduced binary string substitutions: a(i,j) is obtained by substituting i for each 1-bit in j, then dividing by i.

%I A065158 #2 Mar 30 2012 17:38:10
%S A065158 1,1,2,1,2,3,1,2,5,4,1,2,5,4,5,1,2,9,4,9,6,1,2,9,4,9,10,7,1,2,9,4,17,
%T A065158 10,21,8,1,2,9,4,17,18,21,8,9,1,2,17,4,17,18,73,8,17,10,1,2,17,4,17,
%U A065158 18,73,8,17,18,11,1,2,17,4,33,18,73,8,33,18,37,12,1,2,17,4,33,34,73,8,33
%N A065158 Table of reduced binary string substitutions: a(i,j) is obtained by substituting i for each 1-bit in j, then dividing by i.
%C A065158 Table origin is a(1,1). a(1,n)=n. a(n,1)=1. By convention a(0,n)=a(n,0)=0. a(i,j)=A065157(i,j)/i. a(n,n)=A065160(n)=A065159(n)/n.
%e A065158 a(3,5): 5=101->(3)0(3)=(11)0(11)=11011=27; 27/3=9. a(5,3): 3=11->(5)(5)=(101)(101)=101101=45; 45/5=9
%Y A065158 A065157, A065159, A065160.
%K A065158 base,easy,nonn,tabl
%O A065158 1,3
%A A065158 _Marc LeBrun_, Oct 18 2001