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.

A268877 Number of sequences in {1,...,n}^n with longest increasing subsequence of length ten.

This page as a plain text file.
%I A268877 #4 Feb 15 2016 15:31:39
%S A268877 1,1200,502723,126590751,23612496545,3629560710364,489403318321789,
%T A268877 60236078765487885,6951229492238260300,766382530059604734389,
%U A268877 81829925127960010076736
%N A268877 Number of sequences in {1,...,n}^n with longest increasing subsequence of length ten.
%Y A268877 Column k=10 of A245667.
%K A268877 nonn
%O A268877 10,2
%A A268877 _Alois P. Heinz_, Feb 15 2016