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.

A147700 Late-growing permutations: number of permutations of 11 indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations.

This page as a plain text file.
%I A147700 #7 Dec 13 2023 08:43:43
%S A147700 1,58786,11377249621920,32371149339259024610992,
%T A147700 4228135363283244543270651711564000,
%U A147700 2507864854806378467366565303442444098886802152
%N A147700 Late-growing permutations: number of permutations of 11 indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations.
%Y A147700 Cf. A147681.
%Y A147700 Column k=11 of A215561.
%K A147700 nonn
%O A147700 1,2
%A A147700 _R. H. Hardin_, May 01 2009