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.

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, 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, 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

Offset

1,3

Comments

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.

Links

Table of n, a(n) for n=1..87.

Example

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

Crossrefs

A065157, A065159, A065160.

Sequence in context: A172288 A134628 A064882 * A364842 A181842 A209564

Adjacent sequences: A065155 A065156 A065157 * A065159 A065160 A065161

Keyword

base,easy,nonn,tabl

Author

Marc LeBrun, Oct 18 2001

Status

approved