A088670 Number of partitions of n into distinct decimal repdigit numbers.

1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 9, 11, 13, 14, 17, 19, 21, 23, 26, 27, 30, 32, 34, 36, 37, 39, 40, 42, 42, 44, 44, 45, 45, 47, 47, 47, 49, 48, 50, 50, 52, 52, 55, 55, 58, 60, 60, 64, 65, 68, 69, 73, 73, 77, 78, 82, 84, 84, 88, 88, 92, 92, 96, 96, 100, 100, 105, 107, 107, 113

Offset: 0

Author

Reinhard Zumkeller, Oct 03 2003

Keywords

• nonn
• base

Comments

a(n) <= A000009(n).

Not the same as A091581: a(n) < A091581(n) for n > 101.

A109967(n) = a(n+1) - a(n). - Reinhard Zumkeller, Jul 06 2005

Links

• Alois P. Heinz, Table of n, a(n) for n = 0..20000 (first 1001 terms from Reinhard Zumkeller)
• Eric Weisstein's World of Mathematics, Repdigit
• Eric Weisstein's World of Mathematics, Partition

Crossrefs

Cf. A010785, A088669, A109968, A131364.

Programs

Haskell

a088670 = p $ tail a010785_list where
   p _      0 = 1
   p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m
-- Reinhard Zumkeller, Dec 10 2011

Extensions

a(0)=1 added and offset adjusted by Reinhard Zumkeller, Dec 10 2011