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.

A273737 Number of permutations of n elements divided by the number of 9-ary heaps on n+1 elements.

This page as a plain text file.
%I A273737 #7 May 28 2016 20:56:17
%S A273737 1,1,1,1,1,1,1,1,1,1,2,3,4,5,6,7,8,9,10,20,30,40,50,60,70,80,90,100,
%T A273737 200,300,400,500,600,700,800,900,1000,2000,3000,4000,5000,6000,7000,
%U A273737 8000,9000,10000,20000,30000,40000,50000,60000,70000,80000,90000,100000
%N A273737 Number of permutations of n elements divided by the number of 9-ary heaps on n+1 elements.
%C A273737 The first term with more than one nonzero digit (and thus not a member of A037124) is a(91) = 2200000000.
%H A273737 Alois P. Heinz, <a href="/A273737/b273737.txt">Table of n, a(n) for n = 0..1000</a>
%H A273737 Wikipedia, <a href="https://en.wikipedia.org/wiki/D-ary_heap">D-ary heap</a>
%F A273737 a(n) = A000142(n)/A273696(n+1).
%Y A273737 Column k=9 of A273730.
%Y A273737 Cf. A000142, A037124, A273696.
%K A273737 nonn
%O A273737 0,11
%A A273737 _Alois P. Heinz_, May 28 2016