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.
G.f.: A(x) = 1 + x + x^3 + 27*x^6 + 10666*x^9 + 6174792*x^12 +... such that: A(x*G(x)) = G(x) = g.f. of A277041 where G(x) = 1 + x + x^2 + 2*x^3 + 5*x^4 + 11*x^5 + 51*x^6 + 246*x^7 + 897*x^8 + 13526*x^9 + 115631*x^10 + 614681*x^11 + 8739556*x^12 + 89877217*x^13 + 596072842*x^14 +...+ A277041(n)*x^n +...
G.f.: A(x) = 1 + x^3 + 30*x^6 + 10921*x^9 + 6308995*x^12 +... such that the binomial transform forms the g.f. of A277041: A(x/(1-x))/(1-x) = 1 + x + x^2 + 2*x^3 + 5*x^4 + 11*x^5 + 51*x^6 + 246*x^7 + 897*x^8 + 13526*x^9 + 115631*x^10 + 614681*x^11 + 8739556*x^12 + 89877217*x^13 + 596072842*x^14 +...+ A277041(n)*x^n +... Also, A(x/(G(x) - x)) = G(x) - x where G(x) = g.f. of A277042 where G(x) = 1 + x + x^3 + 27*x^6 + 10666*x^9 + 6174792*x^12 +...+ A277042(n)*x^n +...
{ a(n) = local(m=n + ceil(log(n+3)/log(3)), B=sum(k=0, m, x^(3^k))); polcoeff((B+O(x^(3^m+n+1)))^(n+1), 3^m+n) }
for(n=0,15,print1(a(n),", "))
Comments