[seqfan] Re: A054767 Period of the sequence of Bell numbers mod n

franktaw at netscape.net franktaw at netscape.net
Tue Jul 31 11:36:28 CEST 2012


The value for A054767(26) is clearly wrong.

The formula:

   If gcd(n,m) = 1, a(n*m) = lcm(a(n), a(m))

is true for the periods of any sequence modulo n, if those are defined; 
it in no way depends on the properties of the Bell numbers.

The value was added by Neil on Jan 30 2009.

Franklin T. Adams-Watters

-----Original Message-----
From: Jean-François Alcover <jf.alcover at gmail.com>

Bonjour,

According to the given formula, a(p*q) = a(p)*a(q) holds if p & q are 
prime.
So, I wonder why a(26)=117 instead of a(2)*a(13)=3*25239592216021
What do you think ?

jfa
  



More information about the SeqFan mailing list