you are taking wrong formula.
For a B+ tree the order of a node is the maximum number of keys that it can contain.
for B+ tree
if p is the order then
in leaf node there are p <key,record pointer> and 1 block pointer.
(p)∗(Recordpointer+Keysize)+BlockPointerSize ≤ BlockSize