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.

A214274 Number of compositions of n where the difference between largest and smallest parts equals 5 and adjacent parts are unequal.

This page as a plain text file.
%I A214274 #11 Sep 01 2014 11:43:21
%S A214274 0,2,1,8,12,23,56,95,186,349,649,1181,2168,3932,7045,12741,22716,
%T A214274 40528,72086,127802,226191,399378,704011,1238513,2176306,3817950,
%U A214274 6689530,11707266,20465195,35738757,62350777,108682236,189279785,329390352,572788101,995343179
%N A214274 Number of compositions of n where the difference between largest and smallest parts equals 5 and adjacent parts are unequal.
%H A214274 Alois P. Heinz and Vaclav Kotesovec, <a href="/A214274/b214274.txt">Table of n, a(n) for n = 6..2000</a> (first 250 terms from Alois P. Heinz)
%F A214274 a(n) ~ c * d^n, where d = 1.70794647064333012330..., c = 0.5176707727128993957... . - _Vaclav Kotesovec_, Sep 01 2014
%e A214274 a(7) = 2: [6,1], [1,6].
%e A214274 a(8) = 1: [1,6,1].
%e A214274 a(9) = 8: [7,2], [6,2,1], [6,1,2], [2,7], [2,6,1], [2,1,6], [1,6,2], [1,2,6].
%e A214274 a(10) = 12: [6,3,1], [6,1,3], [6,1,2,1], [3,6,1], [3,1,6], [2,1,6,1], [1,6,3], [1,6,2,1], [1,6,1,2], [1,3,6], [1,2,6,1], [1,2,1,6].
%Y A214274 Column k=5 of A214269.
%K A214274 nonn
%O A214274 6,2
%A A214274 _Alois P. Heinz_, Jul 09 2012