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.

A195067 G.f. A(x) satisfies A(x) = Sum{n>=0} x^n * A(2*n*x).

Original entry on oeis.org

1, 1, 3, 17, 191, 4261, 189123, 16723689, 2949213319, 1037964817357, 729449200732395, 1024041038817726353, 2872628913886690237679, 16105674069113302453209781, 180504701103754829110217971731, 4044484405239396750189431682523833
Offset: 0

Views

Author

Paul D. Hanna, Sep 08 2011

Keywords

Examples

			G.f.: A(x) = 1 + x + 3*x^2 + 17*x^3 + 191*x^4 + 4261*x^5 +...
where:
A(x) = 1 + x*A(2*x) + x^2*A(4*x) + x^3*A(6*x) + x^4*A(8*x) + x^5*A(10*x) +...
		

Crossrefs

Programs

  • Mathematica
    a[0] = 1; a[n_] := a[n] = Sum[2^k * (n-k)^k * a[k], {k, 0, n-1}]; Table[a[n], {n, 0, 20}] (* Vaclav Kotesovec, Jul 03 2025 *)
  • PARI
    {a(n)=local(A=1+x+x*O(x^n)); for(k=1, n, A=1+sum(j=1, n, x^j*subst(A,x,2*j*x))); polcoeff(A, n)}
    
  • PARI
    {a(n)=if(n==0, 1, sum(k=0, n-1, 2^k*(n-k)^k*a(k)))}

Formula

a(n) = Sum_{k=0..n-1} 2^k*(n-k)^k * a(k) for n>0 with a(0)=1.
a(n) ~ c * (1 + sqrt(3))^n * 2^(n*(n-3)/2), where c = 0.9296543230172164460137009343716233391546324099495685771220234877636263909188... - Vaclav Kotesovec, Jul 03 2025

A385550 E.g.f. A(x) satisfies A(x) = Sum_{k>=0} x^k/k! * A(-k*x).

Original entry on oeis.org

1, 1, -1, -8, -3, 516, 235, -336258, -3909367, 1462013704, 28386802071, -43272301150110, -3999150112115411, 7064064858964289580, 1224799123758409303091, -6776368902478388538739274, -3903339581644484604889375215, 32981625415507385681195122476432
Offset: 0

Views

Author

Seiichi Manyama, Jul 03 2025

Keywords

Crossrefs

Programs

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

Formula

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