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!)
A026932 Triangular array T read by rows: T(n,k) = number of partitions of n into an even number of parts, each <= k. 0
0, 1, 1, 0, 1, 1, 1, 2, 3, 3, 0, 1, 2, 3, 3, 1, 2, 4, 5, 6, 6, 0, 2, 3, 5, 6, 7, 7, 1, 3, 6, 8, 10, 11, 12, 12, 0, 2, 5, 8, 10, 12, 13, 14, 14, 1, 3, 8, 12, 16, 18, 20, 21, 22, 22, 0, 3, 7, 13, 17, 21, 23, 25, 26, 27, 27, 1, 4, 11, 18, 25, 30, 34, 36, 38 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,8
LINKS
FORMULA
T(n, k) = Sum_{i=1..k} A026921(n, i).
CROSSREFS
Sequence in context: A242457 A340261 A190146 * A087401 A332915 A192498
KEYWORD
nonn,tabl
AUTHOR
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 March 19 03:33 EDT 2024. Contains 370952 sequences. (Running on oeis4.)