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.

A120522 First differences of successive meta-Fibonacci numbers A006949.

This page as a plain text file.
%I A120522 #8 Nov 27 2018 09:34:45
%S A120522 1,0,1,0,0,1,1,0,0,0,1,1,0,1,1,0,0,0,0,1,1,0,1,1,0,0,1,1,0,1,1,0,0,0,
%T A120522 0,0,1,1,0,1,1,0,0,1,1,0,1,1,0,0,0,1,1,0,1,1,0,0,1,1,0,1,1,0,0,0,0,0,
%U A120522 0,1,1,0,1,1,0
%N A120522 First differences of successive meta-Fibonacci numbers A006949.
%H A120522 C. Deugau and F. Ruskey, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL12/Ruskey/ruskey6.pdf">Complete k-ary Trees and Generalized Meta-Fibonacci Sequences</a>, J. Integer Seq., Vol. 12. [This is a later version than that in the GenMetaFib.html link]
%H A120522 C. Deugau and F. Ruskey, <a href="http://www.cs.uvic.ca/~ruskey/Publications/MetaFib/GenMetaFib.html">Complete k-ary Trees and Generalized Meta-Fibonacci Sequences</a>
%H A120522 B. Jackson and F. Ruskey, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v13i1r26">Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes</a>, Electronic Journal of Combinatorics, 13 (2006), #R26, 13 pages.
%F A120522 d(n) = 0 if node n is an inner node, or 1 if node n is a leaf.
%F A120522 G.f.: z (1 + z^2 ( (1 - z^[1]) / (1 - z^[1]) + z^3 * (1 - z^(2 * [i]))/(1 - z^[1]) ( (1 - z^[2]) / (1 - z^[2]) + z^5 * (1 - z^(2 * [2]))/(1 - z^[2]) (..., where [i] = (2^i - 1).
%p A120522 d := n -> if n=1 then 1 else A006949(n)-A006949(n-1) fi;
%Y A120522 Cf. A006949, A120511.
%K A120522 nonn
%O A120522 1,1
%A A120522 _Frank Ruskey_ and Chris Deugau (deugaucj(AT)uvic.ca), Jun 20 2006