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 A194717 #9 Jul 13 2015 19:07:28 %S A194717 0,1,126,1181,4966,14289,32966,65821,118686,198401,312814,470781, %T A194717 682166,957841,1309686,1750589,2294446,2956161,3751646,4697821, %U A194717 5812614,7114961,8624806,10363101,12351806,14613889,17173326,20055101,23285206,26890641,30899414,35340541 %N A194717 Number of n-ary words beginning with the first character of the alphabet, that can be built by inserting five doublets into the initially empty word. %H A194717 Alois P. Heinz, <a href="/A194717/b194717.txt">Table of n, a(n) for n = 0..1000</a> %F A194717 G.f.: -x*(1+121*x+561*x^2+311*x^3+14*x^4) / (x-1)^5. %F A194717 a(0) = 0, a(n) = 1+(8+(27+(48+42*(n-1))*(n-1))*(n-1))*(n-1) for n>0. %e A194717 a(1) = 1: aaaaaaaaaa (with 1-ary alphabet {a}). %p A194717 a:= n-> `if`(n=0, 0, (x-> 1+(8+(27+(48+42*x)*x)*x)*x)(n-1)): %p A194717 seq(a(n), n=0..40); %Y A194717 Row n=5 of A183134. %K A194717 nonn %O A194717 0,3 %A A194717 _Alois P. Heinz_, Sep 02 2011