|
Search: id:A094615
|
|
|
| A094615 |
|
Triangular array T of numbers generated by these rules: 1 is in T; and if x is in T, then 2x+1 and 3x+2 are in T. |
|
+0
2
|
|
| 1, 3, 5, 7, 11, 17, 15, 23, 35, 53, 31, 47, 71, 107, 161, 63, 95, 143, 215, 323, 485, 127, 191, 287, 431, 647, 971, 1457, 255, 383, 575, 863, 1295, 1943, 2915, 4373, 511, 767, 1151, 1727, 2591, 3887, 5831, 8747, 13121, 1023, 1535, 2303, 3455, 5183, 7775
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
T(n,0)=-1+2^(n+1)=A000225(n+1); T(n,n)=-1+2*3^n=A048473(n); T(2n,n)=-1+2*6^n; row sums = A094616.
|
|
FORMULA
|
To obtain row n from row n-1, apply 2x+1 to each x in row n-1 and then put -1+2*3^n at the end. Or, instead, apply 3x+2 to each x in row n-1 and then put -1+2^(n+1) at the beginning.
|
|
EXAMPLE
|
Rows 0 to 3:
1 = T(0,0)
3 5 = T(1,0) T(1,1), etc.
7 11 17
15 23 35 53
|
|
CROSSREFS
|
Cf. A094616, A094617.
Sequence in context: A116582 A052003 A019449 this_sequence A155542 A082373 A116959
Adjacent sequences: A094612 A094613 A094614 this_sequence A094616 A094617 A094618
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), May 14 2004
|
|
|
Search completed in 0.002 seconds
|
