login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116402 Number of representations of n as a sum of distinct elements of the Fibonacci-type sequence beginning 1, 5, 6, 11, 17, ... 2

%I #12 Sep 16 2015 10:21:44

%S 1,1,0,0,0,1,2,1,0,0,0,2,2,0,0,0,1,3,2,0,0,0,2,3,1,0,0,0,3,3,0,0,0,2,

%T 4,2,0,0,0,3,3,0,0,0,1,4,3,0,0,0,3,5,2,0,0,0,4,4,0,0,0,2,5,3,0,0,0,3,

%U 4,1,0,0,0,4,4,0,0,0,3,6,3,0,0,0,5,5,0,0,0,2

%N Number of representations of n as a sum of distinct elements of the Fibonacci-type sequence beginning 1, 5, 6, 11, 17, ...

%H Alois P. Heinz, <a href="/A116402/b116402.txt">Table of n, a(n) for n = 0..14517</a>

%H J. Berstel, <a href="http://www-igm.univ-mlv.fr/~berstel/Articles/2001ExerciceAldo.pdf">An Exercise on Fibonacci Representations</a>, RAIRO/Informatique Theorique, Vol. 35, No 6, 2001, pp. 491-498, in the issue dedicated to Aldo De Luca on the occasion of his 60th anniversary.

%H D. A. Klarner, Representations of N as a sum of distinct elements from special sequences, <a href="http://www.fq.math.ca/Scanned/4-4/klarner-a.pdf">part 1</a>, <a href="http://www.fq.math.ca/Scanned/4-4/klarner-b.pdf">part 2</a>, Fib. Quart., 4 (1966), 289-306 and 322.

%H Casey Mongoven, <a href="http://caseymongoven.com/catalogue/b311.html">Y(n) Rep Sequence no. 1</a>; electronic music created with this sequence.

%Y Cf. A022095, A116403, A000121.

%K nonn

%O 0,7

%A _Casey Mongoven_, Feb 13 2006

%E a(0)=1 corrected by _Alois P. Heinz_, Sep 16 2015

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 19:59 EDT 2024. Contains 371963 sequences. (Running on oeis4.)