A104709 - cp's OEIS frontend

A104709 Triangle read by rows: T(n,k) = Sum_{j=0..n} 2^(n-j)binomial(j,k) for n >= 0 and 0 <= k <= n; also, Riordan array (1/((1-x)(1-2*x)), x/(1-x)).

n	a(n)
0	1
1	3
2	1
3	7
4	4
5	1
6	15
7	11
8	5
9	1
10	31
11	26
12	16
13	6
14	1
15	63
16	57
17	42
18	22
19	7
20	1
21	127
22	120
23	99
24	64
25	29
26	8
27	1
28	255
29	247
30	219
31	163
32	93
33	37
34	9
35	1
36	511
37	502
38	466
39	382
40	256
41	130
42	46
43	10
44	1
45	1023
46	1013
47	968
48	848
49	638
50	386
51	176
52	56
53	11
54	1
55	2047
56	2036
57	1981
58	1816
59	1486
60	1024
61	562
62	232
63	67

[1, 3, 1, 7, 4, 1, 15, 11, 5, 1, 31, 26, 16, 6, 1, 63, 57, 42, 22, 7, 1, 127, 120, 99, 64, 29, 8, 1, 255, 247, 219, 163, 93, 37, 9, 1, 511, 502, 466, 382, 256, 130, 46, 10, 1, 1023, 1013, 968, 848, 638, 386, 176, 56, 11, 1, 2047, 2036, 1981, 1816, 1486, 1024, 562, 232, 67]

cp's OEIS Frontend

A104709 Triangle read by rows: T(n,k) = Sum_{j=0..n} 2^(n-j)binomial(j,k) for n >= 0 and 0 <= k <= n; also, Riordan array (1/((1-x)(1-2*x)), x/(1-x)).

Table of values

List of values

cp's OEIS Frontend

A104709 Triangle read by rows: T(n,k) = Sum_{j=0..n} 2^(n-j)*binomial(j,k) for n >= 0 and 0 <= k <= n; also, Riordan array (1/((1-x)*(1-2*x)), x/(1-x)).

Table of values

List of values

A104709 Triangle read by rows: T(n,k) = Sum_{j=0..n} 2^(n-j)binomial(j,k) for n >= 0 and 0 <= k <= n; also, Riordan array (1/((1-x)(1-2*x)), x/(1-x)).