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.
%I A207834 #14 Mar 30 2012 18:37:37
%S A207834 1,5,25,130,1295,38861,4227075,1309117220,1123176929475,
%T A207834 2564594183278115,15604715134340991949,251021373648740285348860,
%U A207834 10668788238489683954523431475,1195322752666989652479885363067075,352750492054485236937115646128341734205
%N A207834 G.f.: exp( Sum_{n>=1} 5*L(n)*x^n/n ), where L(n) = Fibonacci(n-1)^n + Fibonacci(n+1)^n.
%C A207834 Given g.f. A(x), note that A(x)^(1/5) is not an integer series.
%C A207834 Compare the definition to the g.f. of the Fibonacci numbers:
%C A207834 1/(1-x-x^2) = exp( Sum_{n>=1} Lucas(n)*x^n/n ), where Lucas(n) = Fibonacci(n-1) + Fibonacci(n+1).
%e A207834 G.f.: A(x) = 1 + 5*x + 25*x^2 + 130*x^3 + 1295*x^4 + 38861*x^5 +...
%e A207834 such that, by definition,
%e A207834 log(A(x))/5 = x + 5*x^2/2 + 28*x^3/3 + 641*x^4/4 + 33011*x^5/5 +...+ (Fibonacci(n-1)^n + Fibonacci(n+1)^n)*x^n/n +...
%o A207834 (PARI) {L(n)=fibonacci(n-1)^n+fibonacci(n+1)^n}
%o A207834 {a(n)=polcoeff(exp(sum(m=1,n,5*L(m)*x^m/m)+x*O(x^n)),n)}
%o A207834 for(n=0,51,print1(a(n),", "))
%Y A207834 Cf. A207835, A156216, A166168.
%K A207834 nonn
%O A207834 0,2
%A A207834 _Paul D. Hanna_, Feb 20 2012