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.

A321842 Number of words w of length n such that each letter of the senary alphabet is used at least once and 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 A321842 #3 Nov 19 2018 18:03:57
%S A321842 720,2520,11760,43848,176490,665115,2630715,10224492,41126477,
%T A321842 165441810,683213215,2840595291,12061223560,51668953199,225204435800,
%U A321842 990537353423,4420156777761,19894290092220,90640449133488,416216322774452,1931286827029792,9024993532633957
%N A321842 Number of words w of length n such that each letter of the senary alphabet is used at least once and 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.
%Y A321842 Column k=6 of A257783.
%K A321842 nonn
%O A321842 6,1
%A A321842 _Alois P. Heinz_, Nov 19 2018

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.