This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A050256 Diaconis-Mosteller approximation to the Birthday problem function. 2

%I

%S 16,86,185,307,448,606,778,965,1164,1376,1599,1832,2077,2331,2595,

%T 2868,3150,3440,3739,4047,4362,4685,5016,5354,5699,6052,6411,6777,

%U 7150,7530,7916,8309,8708,9113,9524,9941,10364,10793,11227,11667

%N Diaconis-Mosteller approximation to the Birthday problem function.

%H Iain Fox, <a href="/A050256/b050256.txt">Table of n, a(n) for n = 2..10000</a>

%H P. Diaconis and F. Mosteller, <a href="http://www.math.northwestern.edu/~fcale/CCC/DC.pdf">Methods of studying coincidences</a>, J. Amer. Statist. Assoc. 84 (1989), pp. 853-861.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/BirthdayProblem.html">Birthday Problem</a>

%F a(n) = floor(47*(n-1.5)^(3/2)). - _Derek Orr_, Sep 05 2015

%o (PARI) vector(50,n,n++;floor(47*(n-1.5)^(3/2))) \\ _Derek Orr_, Sep 05 2015

%o (PARI) a(n) = floor(47*(n-1.5)^1.5) \\ _Charles R Greathouse IV_, Sep 05 2015

%Y Cf. A014088, A050255.

%K nonn

%O 2,1

%A _Eric W. Weisstein_

%E First term removed by _Derek Orr_, Sep 05 2015

%E Offset corrected by _Iain Fox_, Nov 16 2017

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.

Last modified July 19 08:23 EDT 2019. Contains 325155 sequences. (Running on oeis4.)