cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A355087 E.g.f. A(x) satisfies A(x) = 1 - log(1-x) * A(3*x).

Original entry on oeis.org

1, 1, 7, 200, 22008, 8968614, 13103201154, 66911528280456, 1170951806182816008, 69148802888161984160496, 13610904625275511792310726256, 8840888240006182011615570947541552, 18793694994107665289261434484161549856688
Offset: 0

Views

Author

Seiichi Manyama, Jun 18 2022

Keywords

Crossrefs

Programs

  • PARI
    a_vector(n) = my(v=vector(n+1)); v[1]=1; for(i=1, n, v[i+1]=sum(j=1, i, 3^(i-j)*(j-1)!*binomial(i, j)*v[i-j+1])); v;

Formula

a(0) = 1; a(n) = Sum_{k=1..n} 3^(n-k) * (k-1)! * binomial(n,k) * a(n-k).

A355085 E.g.f. A(x) satisfies A(x) = 1 + log(1+x) * A(3*x).

Original entry on oeis.org

1, 1, 5, 128, 13572, 5462934, 7948602294, 40533916402440, 709019302729063320, 41863690463023189162224, 8239820880700969013925719856, 5352039696398504114334881521575792, 11377141201027327036487229661596883688304
Offset: 0

Views

Author

Seiichi Manyama, Jun 18 2022

Keywords

Crossrefs

Programs

  • PARI
    a_vector(n) = my(v=vector(n+1)); v[1]=1; for(i=1, n, v[i+1]=sum(j=1, i, (-1)^(j-1)*3^(i-j)*(j-1)!*binomial(i, j)*v[i-j+1])); v;

Formula

a(0) = 1; a(n) = Sum_{k=1..n} (-1)^(k-1) * 3^(n-k) * (k-1)! * binomial(n,k) * a(n-k).
Showing 1-2 of 2 results.