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!)
A031506 Number of consecutive integers placed in n bins under a certain packing scheme. 0
1, 4, 13, 36, 96, 253, 664, 1740, 4557, 11932, 31240, 81789, 214128, 560596, 1467661, 3842388, 10059504, 26336125, 68948872, 180510492, 472582605, 1237237324, 3239129368, 8480150781, 22201322976 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
REFERENCES
Phyllis Chinn and Jason Willard, "Fibonacci in a Bin Packing Problem", Fibonacci in a bin-packing problem. Proceedings of the Thirty-first Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 2000). Congr. Numer. 147 (2000), 97-104.
LINKS
FORMULA
G.f.: (1+x^2-x^3)/(1-4*x+4*x^2-x^3).
For n>0, Fibonacci(2n) + Lucas(2n+1) - 1.
CROSSREFS
Sequence in context: A102301 A206603 A271176 * A251701 A291702 A348476
KEYWORD
nonn
AUTHOR
STATUS
approved

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 19 23:15 EDT 2024. Contains 371798 sequences. (Running on oeis4.)