OFFSET
0,1
COMMENTS
The solution of the discrete parking problem when infinite lattice randomly filled with L-length segments at L=4.
At L=3 it is equal to 3*(Dawson(2) - Dawson(1)/e^3) (see A307154).
At L=2 it is equal to 1-1/e^2 (see A219863).
The general solution of the discrete parking problem when infinite lattice randomly filled with L-length segments is equal to L*e(-2H(L-1))*Integral_{x=0..1} e^(2*(t + t^2/2 + t^3/3 + ... + t^(L-1)/(L-1))) dx, where H(L) is harmonic number.
Also, the limit of the following recurrence as n tends to infinity: a(n) = (4 + 2(n-4)*a(n-4) + (n-1)*(n-4)*a(n-1))/(n*(n-3)); a(0) = 0; a(1) = 0; a(2) = 0; a(3) = 0.
If L tends to infinity, then the fraction of occupied places is equal to Rényi's parking constant (see A050996).
LINKS
D. G. Radcliffe, Fat men sitting at a bar
Philipp O. Tsvetkov, Stoichiometry of irreversible ligand binding to a one-dimensional lattice, Scientific Reports, Springer Nature (2020) Vol. 10, Article number: 21308.
FORMULA
4*Integral_{x=0..1} e^(2*(t + t^2/2 + t^3/3)) dx / e^(11/3).
EXAMPLE
0.80389347991537697266629741950321342054687916485770835923972993280709456095...
MAPLE
evalf(Integrate(4*exp(2*(t + t^2/2 + t^3/3) - 11/3), t= 0..1), 120); # Vaclav Kotesovec, Mar 28 2019
MATHEMATICA
RealDigits[ N[(4*Integrate[E^(2*(t + t^2/2 + t^3/3)), {t, 0, 1}])/E^(11/3), 200]][[1]]
PROG
(PARI) intnum(t=0, 1, 4*exp(2*(t + t^2/2 + t^3/3) - 11/3)) \\ Michel Marcus, May 10 2019
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
Philipp O. Tsvetkov, Mar 28 2019
STATUS
approved