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.

A211952 Number of distinct finite languages over 3-ary alphabet, whose minimum regular expression has ordinary length n.

This page as a plain text file.
%I A211952 #7 Nov 08 2013 23:36:29
%S A211952 5,9,33,117,391,1350,4546,15753,55053,196185
%N A211952 Number of distinct finite languages over 3-ary alphabet, whose minimum regular expression has ordinary length n.
%H A211952 Hermann Gruber, Jonathan Lee, and Jeffrey Shallit, <a href="http://arxiv.org/abs/1204.4982">Enumerating regular expressions and their languages</a>, arXiv:1204.4982v1 [cs.FL]
%K A211952 nonn,hard
%O A211952 1,1
%A A211952 _Hermann Gruber_, Apr 26 2012