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 A241950 #11 Jan 05 2025 19:51:40
%S A241950 1,0,1,1,1,1,2,1,1,3,2,2,3,3,2,5,4,3,5,6,4,6,6,4,7,8,7,7,10,8,10,11,9,
%T A241950 10,12,12,11,13,11,14,14,15,15,16,17,19,18,17,20,19,20,22,22,20,26,25,
%U A241950 23,27,27,25,29,30,24,31,30,29,31,34,32,35,39,34,39,39,39,39,42,39,44,44,43,47,47,48,51,51,48,56,52,53,55,56,54,61,62,56,66
%N A241950 Number of possible representations of n as a sum of distinct positive integers from the Fibonacci-type sequences 0,2,2,4,6,10,16,... and 0,3,3,6,9,15,... (A118658 and A022086).
%H A241950 Alois P. Heinz, <a href="/A241950/b241950.txt">Table of n, a(n) for n = 0..20000</a>
%H A241950 D. A. Klarner, Representations of N as a sum of distinct elements from special sequences, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/4-4/klarner-a.pdf">part 1</a>, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/4-4/klarner-b.pdf">part 2</a>, Fib. Quart., 4 (1966), 289-306 and 322.
%e A241950 a(9) = 3 because 9 can be represented in 3 possible ways as a sum of integers in the set {2,3,4,6,9,10,15,16,...}: 9, 6+3, 4+3+2.
%Y A241950 Cf. A022086, A118658, A000119.
%K A241950 nonn
%O A241950 0,7
%A A241950 _Casey Mongoven_, May 03 2014
%E A241950 a(0)=1 from _Alois P. Heinz_, Sep 16 2015