|
|
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).
|
|
6
|
|
|
2, 192, 3732480, 105815808000000, 15845956399848960000000000, 64521196676588557133336908800000000000000, 11596208520592232147315615803672416545196288000000000000000000, 254410805372253907145905144265082090216385314644252349615132618240000000000000000000000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
FORMULA
|
a(0) = 2; for n >= 1, a(n) = A003961(a(n-1)) * 2^((4*n)+2).
Other identities. For all n >= 1:
|
|
PROG
|
(PARI)
A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ Using code of Michel Marcus
for(n=0, 10, write("b265750.txt", n, " ", A265750(n)));
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|