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.

A322298 Number of permutations of [n] in which the length of every increasing run is 0 or 1 (mod 9).

This page as a plain text file.
%I A322298 #6 Dec 02 2018 18:32:06
%S A322298 1,1,1,1,1,1,1,1,1,2,20,200,1520,9440,50624,242816,1066496,4361216,
%T A322298 16856556,64202712,288983580,2160645840,24525417780,294825080160,
%U A322298 3270522114228,32898687457422,302696887652022,2577419367939422,20537905525582022,155236628840778062
%N A322298 Number of permutations of [n] in which the length of every increasing run is 0 or 1 (mod 9).
%H A322298 Alois P. Heinz, <a href="/A322298/b322298.txt">Table of n, a(n) for n = 0..548</a>
%Y A322298 Cf. A317111, A322251, A322262, A322276, A322297.
%K A322298 nonn
%O A322298 0,10
%A A322298 _Alois P. Heinz_, Dec 02 2018