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.

A185648 Expansion of g.f. 1/ (1-x^1*(1-x^(m+1))/ (1-x^2*(1-x^(m+2))/ (1- ... ))) for m=8.

This page as a plain text file.
%I A185648 #19 Dec 23 2024 14:53:42
%S A185648 1,1,1,2,3,5,9,15,26,45,77,133,230,397,687,1188,2054,3553,6145,10629,
%T A185648 18385,31802,55010,95156,164600,284725,492519,851962,1473732,2549275,
%U A185648 4409764,7628058,13195104,22825046,39483039,68298240,118143130,204365438,353513851
%N A185648 Expansion of g.f. 1/ (1-x^1*(1-x^(m+1))/ (1-x^2*(1-x^(m+2))/ (1- ... ))) for m=8.
%H A185648 Alois P. Heinz, <a href="/A185648/b185648.txt">Table of n, a(n) for n = 0..750</a>
%H A185648 Paul D. Hanna et al., <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2013-July/011445.html">Formula Needed for a Family of Continued Fractions</a> and follow-up messages on the SeqFan list, Jul 28 2013
%F A185648 a(n) ~ c * d^n, where d = 1.729812413755051803149808764090629506945619020643782294236248965..., c = 0.319480257502538464183377228844611044469159258446802374119607096... . - _Vaclav Kotesovec_, Sep 04 2014
%t A185648 nMax = 39; col[m_ /; 0 <= m <= nMax] := 1/(1 + ContinuedFractionK[-x^k (1 - x^(m + k)), 1, {k, 1, Ceiling[nMax/2]}]) + O[x]^(2 nMax) // CoefficientList[#, x]&; A185648 = col[8][[1 ;; nMax]] (* _Jean-François Alcover_, Nov 03 2016 *)
%Y A185648 Column m=8 of A185646.
%K A185648 nonn
%O A185648 0,4
%A A185648 _Alois P. Heinz_, Aug 29 2013