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.

A248519 Number of partitions of n into distinct parts > 0 without 1 as digit, cf. A052383.

This page as a plain text file.
%I A248519 #10 Nov 11 2024 20:31:12
%S A248519 1,0,1,1,1,2,2,3,3,5,4,6,6,7,8,9,9,10,11,10,13,11,14,13,15,15,17,19,
%T A248519 20,25,26,31,35,41,46,55,60,70,78,87,97,106,119,127,141,150,162,175,
%U A248519 186,201,214,229,247,264,285,308,333,363,394,431,470,513,565
%N A248519 Number of partitions of n into distinct parts > 0 without 1 as digit, cf. A052383.
%e A248519 a(10) = #{8+2, 7+3, 6+4, 5+3+2} = 4;
%e A248519 a(11) = #{9+2, 8+3, 7+4, 6+5, 6+3+2, 5+4+2} = 6;
%e A248519 a(12) = #{9+3, 8+4, 7+5, 7+3+2, 6+4+2, 5+4+3} = 6.
%o A248519 (Haskell)
%o A248519 a248519 = p $ tail a052383_list where
%o A248519    p _      0 = 1
%o A248519    p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m
%Y A248519 Cf. A052383, A248518.
%K A248519 nonn,base
%O A248519 0,6
%A A248519 _Reinhard Zumkeller_, Oct 07 2014