|
%I #48 Jun 21 2023 12:41:31
%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,12113,12565,13022,13484
%N a(n) = floor(47*(n-3/2)^(3/2)).
%C Mentioned in the Diaconis-Mosteller article.
%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="https://www.stat.berkeley.edu/~aldous/157/Papers/diaconis_mosteller.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>
%p a:= n-> floor(47*(n-3/2)^(3/2)):
%p seq(a(n), n=2..55); # _Alois P. Heinz_, May 17 2023
%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
%E Entry revised by _N. J. A. Sloane_, Jun 21 2023
|
