A173005 - cp's OEIS frontend

A173005 A product triangle sequence based on recursion:a=4; f(n,a)=(2a+1)f(n-1,a)+f(n-2,a).

n	a(n)
0	1
1	1
2	1
3	1
4	9
5	1
6	1
7	80
8	80
9	1
10	1
11	711
12	6320
13	711
14	1
15	1
16	6319
17	499201
18	499201
19	6319
20	1
21	1
22	56160
23	39430560
24	350439102
25	39430560
26	56160
27	1
28	1
29	499121
30	3114515040
31	246007756722
32	246007756722
33	3114515040
34	499121
35	1
36	1
37	4435929
38	246007257601

[1, 1, 1, 1, 9, 1, 1, 80, 80, 1, 1, 711, 6320, 711, 1, 1, 6319, 499201, 499201, 6319, 1, 1, 56160, 39430560, 350439102, 39430560, 56160, 1, 1, 499121, 3114515040, 246007756722, 246007756722, 3114515040, 499121, 1, 1, 4435929, 246007257601]

cp's OEIS Frontend

A173005 A product triangle sequence based on recursion:a=4; f(n,a)=(2a+1)f(n-1,a)+f(n-2,a).

Table of values

List of values

cp's OEIS Frontend

A173005 A product triangle sequence based on recursion:a=4; f(n,a)=(2*a+1)*f(n-1,a)+f(n-2,a).

Table of values

List of values

A173005 A product triangle sequence based on recursion:a=4; f(n,a)=(2a+1)f(n-1,a)+f(n-2,a).