login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258588 Minimal most likely sum for a roll of n 10-sided dice. 1
1, 11, 16, 22, 27, 33, 38, 44, 49, 55, 60, 66, 71, 77, 82, 88, 93, 99, 104, 110, 115, 121, 126, 132, 137, 143, 148, 154, 159, 165, 170, 176, 181, 187, 192, 198, 203, 209, 214, 220, 225, 231, 236, 242, 247, 253, 258, 264, 269, 275 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..50.

Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

FORMULA

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

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

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

EXAMPLE

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.

MATHEMATICA

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

PROG

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

vector(50, n, a(n))

CROSSREFS

Cf. A030123, A256680, A263941.

Sequence in context: A329389 A227080 A131858 * A110031 A166451 A109307

Adjacent sequences:  A258585 A258586 A258587 * A258589 A258590 A258591

KEYWORD

nonn,easy

AUTHOR

Gianmarco Giordano, Nov 06 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 22:16 EST 2020. Contains 331166 sequences. (Running on oeis4.)