%I #34 May 06 2024 18:46:11

%S 1,3,13,12,781,39,137257,24,39,2343,28531167061,156,25239592216021,

%T 411771,10153,48,51702516367896047761,39,109912203092239643840221,

%U 9372,1784341,85593501183,949112181811268728834319677753,312,3905,75718776648063,117,1647084

%N Period of the sequence of Bell numbers A000110 (mod n).

%C For p prime, a(p) divides (p^p-1)/(p-1) = A023037(p), with equality at least for p up to 19.

%C Wagstaff shows that N(p) = (p^p-1)/(p-1) is the period for all primes p < 102 and for primes p = 113, 163, 167 and 173. For p = 7547, N(p) is a probable prime, which means that this p may have the maximum possible period N(p) also. See A088790. - _T. D. Noe_, Dec 17 2008

%H J. Levine and R. E. Dalton, <a href="http://dx.doi.org/10.1090/S0025-5718-1962-0148604-2">Minimum Periods, Modulo p, of First Order Bell Exponential Integrals</a>, Mathematics of Computation, 16 (1962), 416-423.

%H W. F. Lunnon et al., <a href="http://matwbn.icm.edu.pl/ksiazki/aa/aa35/aa3511.pdf">Arithmetic properties of Bell numbers to a composite modulus I</a>, Acta Arithmetica 35 (1979), pp. 1-16.

%H Samuel S. Wagstaff Jr., <a href="http://www.ams.org/mcom/1996-65-213/S0025-5718-96-00683-7/home.html">Aurifeuillian factorizations and the period of the Bell numbers modulo a prime</a>, Math. Comp. 65 (1996), 383-391.

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

%F If gcd(n,m) = 1, a(n*m) = lcm(a(n), a(m)). But the sequence is not in general multiplicative; e.g. a(2) = 3, a(9) = 39 and a(18) = 39. - _Franklin T. Adams-Watters_, Jun 06 2006

%t (* Warning: this program is just a verification of the existing data

%t and should not be used to extend the sequence beyond a(28) *)

%t BellMod[k_, m_] := Mod[Sum[Mod[StirlingS2[k, j], m], {j, 1, k}], m];

%t BellMod[k_, 1] := BellB[k];

%t period[nn_List] := Module[{lgmin=2, lgmax=5, nn1},

%t lg=If[Length[nn]<=lgmax, lgmin, lgmax];

%t nn1 = nn[[1;;lg]];

%t km=Length[nn]-lg;

%t Catch[Do[If[nn1==nn[[k;;k+lg-1]], Throw[k-1]];

%t If[k==km, Throw[0]], {k, 2, km}]]];

%t dd[n_] := SelectFirst[Table[{d, n/d},

%t {d, Divisors[n][[2;;-2]]}], GCD@@#==1&];

%t a[1]=1;

%t a[p_?PrimeQ] := a[p] = (p^p-1)/(p-1);

%t a[n_/;n>4 && dd[n]!={}] := With[{g = dd[n]}, LCM[a[g[[1]]], a[g[[2]]]]];

%t a[n_/;MemberQ[FactorInteger[n][[All, 2]], 1]] := a[n]=

%t With[{pp = Select[FactorInteger[n], #1[[2]] ==1 &][[All, 1]]},

%t a[n/Times@@pp]*Times@@a/@pp];

%t a[n_/;n>4 && GCD @@ FactorInteger[n][[All, 2]]>1] := a[n]=

%t With[{g=GCD @@ FactorInteger[n][[All, 2]]}, n^(1/g)*a[n^(1-1/g)]];

%t a[n_] := period[Table[BellMod[k, n], {k, 1, 28}]];

%t Table[a[n], {n, 1, 28}] (* _Jean-François Alcover_, Jul 31 2012, updated May 06 2024 *)

%Y Cf. A000110, A023037, A214810.

%K nonn,hard,nice

%O 1,2

%A _Eric W. Weisstein_, Feb 09 2002

%E More information from _Phil Carmody_, Dec 22 2002

%E Extended by _T. D. Noe_, Dec 18 2008

%E a(26) corrected by _Jean-François Alcover_, Jul 31 2012

%E a(18) corrected by _Charles R Greathouse IV_, Jul 31 2012

%E a(27)-a(28) from _Charles R Greathouse IV_, Sep 07 2016