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.
%I A287656 #32 Feb 16 2025 08:33:46
%S A287656 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,1,1,1,
%T A287656 1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,1,1,1,1,1,1,1,1,
%U A287656 1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,2
%N A287656 Number of partitions of n into distinct tetranacci numbers (with a single type of 1) (A000078).
%H A287656 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Fibonaccin-StepNumber.html">Fibonacci n-Step Number</a>
%H A287656 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TetranacciNumber.html">Tetranacci Number</a>
%H A287656 <a href="/index/Par#part">Index entries for related partition-counting sequences</a>
%F A287656 G.f.: Product_{k>=4} (1 + x^A000078(k)).
%e A287656 a(15) = 2 because we have [15] and [8, 4, 2, 1].
%Y A287656 Cf. A000078, A000119, A000121, A003263, A117546, A288120.
%K A287656 nonn
%O A287656 0,16
%A A287656 _Ilya Gutkovskiy_, Jun 05 2017