This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A206245 #12 Feb 16 2025 08:33:16 %S A206245 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, %T A206245 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, %U A206245 7,7,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8 %N A206245 Number of partitions of n into repunit powers, cf. A083278. %C A206245 a(n) = A206244(n) for n <= 120, a(n) > A206244(n) for n > 120. %H A206245 Reinhard Zumkeller, <a href="/A206245/b206245.txt">Table of n, a(n) for n = 0..1000</a> %H A206245 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Repunit.html">Repunit</a> %H A206245 Wikipedia, <a href="http://en.wikipedia.org/wiki/Repunit">Repunit</a> %H A206245 <a href="/index/Par#partN">Index entries for related partition-counting sequences</a> %o A206245 (Haskell) %o A206245 a206245 = p a083278_list where %o A206245 p _ 0 = 1 %o A206245 p rps'@(rp:rps) n = if n < rp then 0 else p rps' (n - rp) + p rps n %Y A206245 Cf. A002275, A000041, A179051. %K A206245 nonn %O A206245 0,12 %A A206245 _Reinhard Zumkeller_, Feb 05 2012