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.

A326507 Number of (binary) max-heaps on n elements from the set {0,1} containing exactly six 0's.

This page as a plain text file.
%I A326507 #10 Feb 16 2025 08:33:58
%S A326507 1,1,2,5,9,16,27,44,68,114,156,236,325,500,622,900,1143,1659,1954,
%T A326507 2731,3277,4564,5185,7040,8114,10948,12124,16058,17977,23640,25692,
%U A326507 33304,36493,46965,50322,64017,69025,87208,92423,115652,123168,153142,160908,198440
%N A326507 Number of (binary) max-heaps on n elements from the set {0,1} containing exactly six 0's.
%H A326507 Alois P. Heinz, <a href="/A326507/b326507.txt">Table of n, a(n) for n = 6..10000</a>
%H A326507 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Heap.html">Heap</a>
%H A326507 Wikipedia, <a href="https://en.wikipedia.org/wiki/Binary_heap">Binary heap</a>
%H A326507 <a href="/index/Rec#order_21">Index entries for linear recurrences with constant coefficients</a>, signature (1, 2, -2, 3, -3, -8, 8, -2, 2, 12, -12, -2, 2, -8, 8, 3, -3, 2, -2, -1, 1).
%t A326507 LinearRecurrence[{1, 2, -2, 3, -3, -8, 8, -2, 2, 12, -12, -2, 2, -8, 8, 3, -3, 2, -2, -1, 1},{1, 1, 2, 5, 9, 16, 27, 44, 68, 114, 156, 236, 325, 500, 622, 900, 1143, 1659, 1954, 2731, 3277},50] (* _Ray Chandler_, Sep 25 2022 *)
%Y A326507 Column k=6 of A309049.
%K A326507 nonn,easy
%O A326507 6,3
%A A326507 _Alois P. Heinz_, Jul 09 2019