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.

A163189 G.f.: A(x) = exp( Sum_{n>=1} (1 + A000204(n)*x)^n * x^n/n ).

Original entry on oeis.org

1, 1, 2, 5, 14, 40, 159, 812, 5133, 42942, 474619, 6708142, 121367878, 2819170132, 83571532538, 3148951107867, 151069353323782, 9219463980803329, 714951048370178409, 70448496563603216429, 8818161368662624534857
Offset: 0

Views

Author

Paul D. Hanna, Jul 22 2009

Keywords

Comments

Compare to g.f. of Fibonacci sequence: exp( Sum_{n>=1} A000204(n)*x^n/n ), where A000204 is the Lucas numbers.

Examples

			G.f.: A(x) = 1 + x + 2*x^2 + 5*x^3 + 14*x^4 + 40*x^5 + 159*x^6 +...
		

Crossrefs

Programs

  • PARI
    {a(n)=polcoeff(exp(sum(m=1, n+1, (1+(fibonacci(m-1)+fibonacci(m+1))*x+x*O(x^n))^m*x^m/m)), n)}