OFFSET
0,5
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 0..1000
EXAMPLE
a(20) = #{19+1, 16+4, 16+3+1, 13+7, 13+4+3, 12+7+1, 12+4+3+1, 9+7+4, 9+7+3+1} = 9;
a(21) = #{21, 16+4+1, 13+7+1, 13+4+3+1, 12+9, 9+7+4+1} = 6;
a(22) = #{21+1, 19+3, 13+9, 12+9+1, 12+7+3} = 5.
PROG
(Haskell)
import Data.MemoCombinators (memo2, list, integral)
a198727 n = a198727_list !! n
a198727_list = f 0 [] $ tail a003136_list where
f u vs ws'@(w:ws) | u < w = (p' vs u) : f (u + 1) vs ws'
| otherwise = f u (vs ++ [w]) ws
p' = memo2 (list integral) integral p
p _ 0 = 1
p [] _ = 0
p (k:ks) m = if m < k then 0 else p' ks (m - k) + p' ks m
-- Reinhard Zumkeller, Nov 16 2015, Oct 30 2011
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Oct 30 2011
STATUS
approved