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.

A241953 Number of possible representations of n as a sum of distinct positive integers from the Fibonacci-type sequences 2,1,3,4,7,11,... and 0,3,3,6,9,15,... (A000032 and A022086).

This page as a plain text file.
%I A241953 #8 Jan 05 2025 19:51:40
%S A241953 1,1,2,2,2,3,4,3,5,6,6,7,8,8,9,11,10,13,13,14,16,17,16,19,21,19,24,24,
%T A241953 25,27,30,28,32,34,33,38,37,39,42,45,42,49,48,48,55,54,55,59,63,60,68,
%U A241953 66,68,74,74,76,81,82,81,91,86,89,97,96,97,105,104,104,114,110,113,120,120,123,130,128,131,140,137,141,149,146
%N A241953 Number of possible representations of n as a sum of distinct positive integers from the Fibonacci-type sequences  2,1,3,4,7,11,... and 0,3,3,6,9,15,... (A000032 and A022086).
%H A241953 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 A241953 a(10) = 6 because 10 can be represented in 6 possible ways as a sum of integers in the set {1,2,3,4,6,7,9,11,15,...}: 9+1, 7+3, 7+2+1, 6+4, 6+3+1, 4+3+2+1.
%Y A241953 Cf. A000032, A022086, A067595.
%K A241953 nonn
%O A241953 1,3
%A A241953 _Casey Mongoven_, May 03 2014