login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A248519 Number of partitions of n into distinct parts > 0 without 1 as digit, cf. A052383. 3
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, 20, 25, 26, 31, 35, 41, 46, 55, 60, 70, 78, 87, 97, 106, 119, 127, 141, 150, 162, 175, 186, 201, 214, 229, 247, 264, 285, 308, 333, 363, 394, 431, 470, 513, 565 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
LINKS
EXAMPLE
a(10) = #{8+2, 7+3, 6+4, 5+3+2} = 4;
a(11) = #[9+2, 8+3, 7+4, 6+5, 6+3+2, 5+4+2} = 6;
a(12) = #{9+3, 8+4, 7+5, 7+3+2, 6+4+2, 5+4+3} = 6.
PROG
(Haskell)
a248519 = p $ tail a052383_list where
p _ 0 = 1
p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m
CROSSREFS
Sequence in context: A122352 A338903 A362830 * A326670 A361178 A307993
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Oct 07 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 23 04:59 EDT 2024. Contains 373629 sequences. (Running on oeis4.)