|
Search: id:A065157
|
|
|
| A065157 |
|
Table of binary string substitutions: a(i,j) is obtained by substituting i for each 1-bit in j. |
|
+0
4
|
|
| 1, 2, 2, 3, 4, 3, 4, 6, 10, 4, 5, 8, 15, 8, 5, 6, 10, 36, 12, 18, 6, 7, 12, 45, 16, 27, 20, 7, 8, 14, 54, 20, 68, 30, 42, 8, 9, 16, 63, 24, 85, 72, 63, 16, 9, 10, 18, 136, 28, 102, 90, 292, 24, 34, 10, 11, 20, 153, 32, 119, 108, 365, 32, 51, 36, 11, 12, 22, 170, 36, 264, 126
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Table origin is a(1,1). a(1,n)=a(n,1)=n. a(0,n)=a(n,0)=0. a(i,j)=A065158(i,j)*i. a(n,n)=A065159(n)=A065160(n)*n.
|
|
EXAMPLE
|
a(3,5): 5=101->(3)0(3)=(11)0(11)=11011=27. a(5,3): 3=11->(5)(5)=(101)(101)=101101=45.
|
|
CROSSREFS
|
A065158, A065159, A065160.
Sequence in context: A003991 A131923 A119457 this_sequence A051597 A084193 A049787
Adjacent sequences: A065154 A065155 A065156 this_sequence A065158 A065159 A065160
|
|
KEYWORD
|
base,easy,nonn,tabl
|
|
AUTHOR
|
Marc LeBrun (mlb(AT)well.com), Oct 18 2001
|
|
|
Search completed in 0.002 seconds
|
