login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A147583
Number of partitions of n into distinct parts such that 5*u<=v for all pairs (u,v) of parts with u<v.
2
1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 7, 7, 7, 7, 7, 8, 9, 9, 9, 9, 9, 10, 11, 11, 11, 11, 11, 12, 13, 13, 13, 13, 13, 14, 15, 15, 15, 15, 15, 16, 17, 18, 18, 18, 18, 19, 20, 21, 21, 21, 21, 22, 23, 24, 24, 24, 24, 25, 26, 27, 27, 27, 27
OFFSET
1,6
COMMENTS
From Edward Early, Jan 10 2009: (Start)
Also the dimension of the n-th degree part of the mod 5 Steenrod algebra.
Also the number of partitions into parts (5^j-1)/4=1+5+5^2+...+5^(j-1) for j>=1. (End)
LINKS
EXAMPLE
a(29) = #{29,28+1,27+2,26+3,25+4} = 5;
a(30) = #{30,29+1,28+2,27+3,26+4,25+5} = 6;
a(31) = #{31,30+1,29+2,28+3,27+4,26+5,25+5+1} = 7.
PROG
(Haskell)
a147583 = p [1..] where
p _ 0 = 1
p (k:ks) m = if m < k then 0 else p [5 * k ..] (m - k) + p ks m
-- Reinhard Zumkeller, Oct 10 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, following a suggestion of Clark Hanley (clark.hanley(AT)gmx.com), Nov 08 2008
STATUS
approved