cp's OEIS Frontend

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.

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

This page as a plain text file.
%I A088670 #23 Feb 16 2025 08:32:51
%S A088670 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,
%T A088670 40,42,42,44,44,45,45,47,47,47,49,48,50,50,52,52,55,55,58,60,60,64,65,
%U A088670 68,69,73,73,77,78,82,84,84,88,88,92,92,96,96,100,100,105,107,107,113
%N A088670 Number of partitions of n into distinct decimal repdigit numbers.
%C A088670 a(n) <= A000009(n).
%C A088670 Not the same as A091581: a(n) < A091581(n) for n > 101.
%C A088670 A109967(n) = a(n+1) - a(n). - _Reinhard Zumkeller_, Jul 06 2005
%H A088670 Alois P. Heinz, <a href="/A088670/b088670.txt">Table of n, a(n) for n = 0..20000</a> (first 1001 terms from Reinhard Zumkeller)
%H A088670 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Repdigit.html">Repdigit</a>
%H A088670 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Partition.html">Partition</a>
%o A088670 (Haskell)
%o A088670 a088670 = p $ tail a010785_list where
%o A088670    p _      0 = 1
%o A088670    p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m
%o A088670 -- _Reinhard Zumkeller_, Dec 10 2011
%Y A088670 Cf. A010785, A088669, A109968, A131364.
%K A088670 nonn,base
%O A088670 0,4
%A A088670 _Reinhard Zumkeller_, Oct 03 2003
%E A088670 a(0)=1 added and offset adjusted by _Reinhard Zumkeller_, Dec 10 2011