The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A000119

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

Number of representations of n as a sum of distinct Fibonacci numbers.
(history; published version)

#138 by Amiram Eldar at Tue Jul 30 02:15:39 EDT 2024

STATUS

reviewed

approved

#137 by Joerg Arndt at Tue Jul 30 02:05:15 EDT 2024

STATUS

proposed

reviewed

#136 by Jason Yuen at Tue Jul 30 01:56:31 EDT 2024

STATUS

editing

proposed

#135 by Jason Yuen at Tue Jul 30 01:56:05 EDT 2024

COMMENTS

Inverse Euler transform of sequence has generating function Sum_{n>1} (x^F(n) - x^(2*F(n)) ) where F() are the Fibonacci numbers.

STATUS

approved

editing

#134 by Hugo Pfoertner at Sun Jul 28 05:55:44 EDT 2024

STATUS

reviewed

approved

#133 by Joerg Arndt at Sun Jul 28 05:36:10 EDT 2024

STATUS

proposed

reviewed

#132 by Jason Yuen at Sun Jul 28 05:28:17 EDT 2024

STATUS

editing

proposed

#131 by Jason Yuen at Sun Jul 28 05:27:22 EDT 2024

FORMULA

G.f.: Product_{n>=1} 1 + q^F(n+1) = 1 + Sum_{n>=1} ( q^F(n+1) * Product_{k=1..n-1} 1 + q^F(k+1) ). - Joerg Arndt, Oct 20 2012

STATUS

approved

editing

#130 by Amiram Eldar at Mon Nov 13 04:46:20 EST 2023

STATUS

reviewed

approved

#129 by Stefano Spezia at Mon Nov 13 02:04:51 EST 2023

STATUS

proposed

reviewed