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.

A213293 Number of n-length words w over 5-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.

This page as a plain text file.
%I A213293 #5 Jun 15 2012 03:52:31
%S A213293 1,5,25,95,315,895,2535,7280,21562,64924,201975,640915,2095019,
%T A213293 6978713,23859310,82982260,295202798,1066467105,3928481530,
%U A213293 14672457970,55722273963,214254166369,835669136725,3295598362466,13156401722237,53038076210255,216053087821059
%N A213293 Number of n-length words w over 5-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.
%H A213293 Alois P. Heinz, <a href="/A213293/b213293.txt">Table of n, a(n) for n = 0..100</a>
%Y A213293 Column k=5 of A213276.
%K A213293 nonn
%O A213293 0,2
%A A213293 _Alois P. Heinz_, Jun 08 2012