We give some sufficient conditions for {a subset of or equal to aleph(
omega):cf(sup(a boolean AND aleph(n))) = f(n) for n < omega} to be sta
tionary. Thus we get consistency e.g. of cases where f has greater tha
n or equal to three values attained infinitely often. We use pcf, part
ition theorems on trees and games.