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!)
A258588 Minimal most likely sum for a roll of n 10-sided dice. 1

%I #15 Nov 07 2015 06:37:06

%S 1,11,16,22,27,33,38,44,49,55,60,66,71,77,82,88,93,99,104,110,115,121,

%T 126,132,137,143,148,154,159,165,170,176,181,187,192,198,203,209,214,

%U 220,225,231,236,242,247,253,258,264,269,275

%N Minimal most likely sum for a roll of n 10-sided dice.

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1).

%F G.f.: x*(1 + 10*x + 4*x^2 - 4*x^3)/((1 - x)^2*(1 + x)).

%F a(n) = floor(11*n/2) = (22*n + (-1)^n - 1)/4 with n>1, a(1)=1.

%F a(n) = a(n-1) + a(n-2) - a(n-3) for n>4.

%e For n=1, there are ten equally likely outcomes, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 and the smallest of these is 1, so a(1)=1.

%t Join[{1}, Table[(22 n + (-1)^n - 1)/4, {n, 2, 50}]]

%o (PARI) a(n)=if(n<2, 1,11*n\2);

%o vector(50, n, a(n))

%Y Cf. A030123, A256680, A263941.

%K nonn,easy

%O 1,2

%A _Gianmarco Giordano_, Nov 06 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 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)