:: deftheorem Def14 defines Sierp49FS NUMBER14:def 14 :
for m being non zero Nat
for k being Nat
for b₃ being FinSequence of INT holds
( b₃ is Sierp49FS of m,k iff ( len b₃ = len (PrimeDivisorsFS m) & ( for i being object st i in dom b₃ holds
not (PrimeDivisorsFS m) . i divides (b₃ . i) * ((b₃ . i) + (2 * k)) ) ) );