A265750 - cp's OEIS frontend

A265750 Prime factorization representation of polynomials defined recursively by p(0,x)=1 and for n>0: p(n,x) = x*p(n-1,x) + 4n+2. (See A192750).

n	a(n)
0	2
1	192
2	3732480
3	105815808000000
4	15845956399848960000000000
5	64521196676588557133336908800000000000000
6	11596208520592232147315615803672416545196288000000000000000000
7	254410805372253907145905144265082090216385314644252349615132618240000000000000000000000

[2, 192, 3732480, 105815808000000, 15845956399848960000000000, 64521196676588557133336908800000000000000, 11596208520592232147315615803672416545196288000000000000000000, 254410805372253907145905144265082090216385314644252349615132618240000000000000000000000]

cp's OEIS Frontend

A265750 Prime factorization representation of polynomials defined recursively by p(0,x)=1 and for n>0: p(n,x) = x*p(n-1,x) + 4n+2. (See A192750).

Table of values

List of values