A173006 - cp's OEIS frontend

A173006 A product triangle sequence based on recursion:a=5; 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	11
5	1
6	1
7	120
8	120
9	1
10	1
11	1309
12	14280
13	1309
14	1
15	1
16	14279
17	1699201
18	1699201
19	14279
20	1
21	1
22	155760
23	202190640
24	2205562898
25	202190640
26	155760
27	1
28	1
29	1699081
30	24058986960
31	2862818956682
32	2862818956682
33	24058986960
34	1699081
35	1
36	1

[1, 1, 1, 1, 11, 1, 1, 120, 120, 1, 1, 1309, 14280, 1309, 1, 1, 14279, 1699201, 1699201, 14279, 1, 1, 155760, 202190640, 2205562898, 202190640, 155760, 1, 1, 1699081, 24058986960, 2862818956682, 2862818956682, 24058986960, 1699081, 1, 1]

cp's OEIS Frontend

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

Table of values

List of values

cp's OEIS Frontend

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

Table of values

List of values

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