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.

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

This page as a plain text file.
%I A214279 #9 Jan 03 2019 15:59:49
%S A214279 0,2,1,8,12,23,56,100,196,380,734,1365,2588,4852,8987,16728,30868,
%T A214279 56876,104463,191425,349855,638239,1162173,2112115,3833245,6946126,
%U A214279 12570162,22719408,41016345,73967704,133257636,239847038,431310105,774970862,1391362755
%N A214279 Number of compositions of n where the difference between largest and smallest parts equals 10 and adjacent parts are unequal.
%H A214279 Alois P. Heinz, <a href="/A214279/b214279.txt">Table of n, a(n) for n = 11..2000</a>
%e A214279 a(12) = 2: [11,1], [1,11].
%e A214279 a(13) = 1: [1,11,1].
%e A214279 a(14) = 8: [2,12], [2,11,1], [2,1,11], [12,2], [11,2,1], [11,1,2], [1,2,11], [1,11,2].
%e A214279 a(15) = 12: [3,11,1], [3,1,11], [2,1,11,1], [11,3,1], [11,1,3], [11,1,2,1], [1,3,11], [1,2,11,1], [1,2,1,11], [1,11,3], [1,11,2,1], [1,11,1,2].
%Y A214279 Column k=10 of A214269.
%K A214279 nonn
%O A214279 11,2
%A A214279 _Alois P. Heinz_, Jul 09 2012