login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 0
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, 25, 27, 30, 28, 32, 34, 33, 38, 37, 39, 42, 45, 42, 49, 48, 48, 55, 54, 55, 59, 63, 60, 68, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..82.

D. A. Klarner, Representations of N as a sum of distinct elements from special sequences, part 1, part 2, Fib. Quart., 4 (1966), 289-306 and 322.

EXAMPLE

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.

CROSSREFS

Cf. A000032, A022086, A067595.

Sequence in context: A054860 A098745 A029158 * A156197 A155162 A275444

Adjacent sequences:  A241950 A241951 A241952 * A241954 A241955 A241956

KEYWORD

nonn

AUTHOR

Casey Mongoven, May 03 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 17:36 EDT 2020. Contains 334595 sequences. (Running on oeis4.)