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.

A273732 Number of permutations of n elements divided by the number of quaternary heaps on n+1 elements.

This page as a plain text file.
%I A273732 #6 May 28 2016 20:04:34
%S A273732 1,1,1,1,1,2,3,4,5,10,15,20,25,50,75,100,125,250,375,500,625,1500,
%T A273732 2625,4000,5625,12500,20625,30000,40625,87500,140625,200000,265625,
%U A273732 562500,890625,1250000,1640625,3937500,6890625,10500000,14765625,32812500,54140625
%N A273732 Number of permutations of n elements divided by the number of quaternary heaps on n+1 elements.
%H A273732 Alois P. Heinz, <a href="/A273732/b273732.txt">Table of n, a(n) for n = 0..1000</a>
%H A273732 Wikipedia, <a href="https://en.wikipedia.org/wiki/D-ary_heap">D-ary heap</a>
%F A273732 a(n) = A000142(n)/A178009(n+1).
%Y A273732 Column k=4 of A273730.
%Y A273732 Cf. A000142, A178009.
%K A273732 nonn
%O A273732 0,6
%A A273732 _Alois P. Heinz_, May 28 2016