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.

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

This page as a plain text file.
%I A273738 #5 May 28 2016 20:09:57
%S A273738 1,1,1,1,1,1,1,1,1,1,1,2,3,4,5,6,7,8,9,10,11,22,33,44,55,66,77,88,99,
%T A273738 110,121,242,363,484,605,726,847,968,1089,1210,1331,2662,3993,5324,
%U A273738 6655,7986,9317,10648,11979,13310,14641,29282,43923,58564,73205,87846
%N A273738 Number of permutations of n elements divided by the number of 10-ary heaps on n+1 elements.
%H A273738 Alois P. Heinz, <a href="/A273738/b273738.txt">Table of n, a(n) for n = 0..1000</a>
%H A273738 Wikipedia, <a href="https://en.wikipedia.org/wiki/D-ary_heap">D-ary heap</a>
%F A273738 a(n) = A000142(n)/A273697(n+1).
%Y A273738 Column k=10 of A273730.
%Y A273738 Cf. A000142, A273697.
%K A273738 nonn
%O A273738 0,12
%A A273738 _Alois P. Heinz_, May 28 2016