A206245 Number of partitions of n into repunit powers, cf. A083278.

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8

Offset

0,12

Comments

a(n) = A206244(n) for n <= 120, a(n) > A206244(n) for n > 120.

Links

Reinhard Zumkeller, Table of n, a(n) for n = 0..1000

Eric Weisstein's World of Mathematics, Repunit

Wikipedia, Repunit

Index entries for related partition-counting sequences

Prog

(Haskell)
a206245 = p a083278_list where
   p _      0 = 1
   p rps'@(rp:rps) n = if n < rp then 0 else p rps' (n - rp) + p rps n

Crossrefs

Cf. A002275, A000041, A179051.

Sequence in context: A226764 A344420 A206244 * A064458 A125891 A153675

Adjacent sequences: A206242 A206243 A206244 * A206246 A206247 A206248

Keyword

nonn

Author

Reinhard Zumkeller, Feb 05 2012

Status

approved