|
Search: id:A031506
|
|
|
| A031506 |
|
Number of consecutive integers place in n bins under a certain packing scheme. |
|
+0
1
|
|
| 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; listen)
|
|
|
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.
|
|
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: A036643 A000299 A102301 this_sequence A065297 A067635 A003727
Adjacent sequences: A031503 A031504 A031505 this_sequence A031507 A031508 A031509
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
