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!)
A027185 Triangular array O by rows: O(n,k) = number of partitions of n into an odd number of parts, the least being k. 2
1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 3, 0, 0, 0, 1, 3, 1, 0, 0, 0, 1, 6, 1, 0, 0, 0, 0, 1, 7, 2, 0, 0, 0, 0, 0, 1, 12, 2, 1, 0, 0, 0, 0, 0, 1, 14, 4, 1, 0, 0, 0, 0, 0, 0, 1, 22, 4, 2, 0, 0, 0, 0, 0, 0, 0, 1, 27, 6, 2, 1, 0, 0, 0, 0, 0, 0, 0, 1, 40, 7, 3, 1, 0, 0, 0, 0, 0, 0 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,11
LINKS
FORMULA
O(n, k) = E(n-k, k)+E(n-k, k+1)+...+E(n-k, n-k), for 2<=2k<=n, E given by A027186.
T(n,k) + A027186(n,k) = A026794(n,k). - R. J. Mathar, Oct 18 2019
EXAMPLE
1,
0, 1,
1, 0, 1,
1, 0, 0, 1,
3, 0, 0, 0, 1,
3, 1, 0, 0, 0, 1,
6, 1, 0, 0, 0, 0, 1,
7, 2, 0, 0, 0, 0, 0, 1,
12, 2, 1, 0, 0, 0, 0, 0, 1,
14, 4, 1, 0, 0, 0, 0, 0, 0, 1,
22, 4, 2, 0, 0, 0, 0, 0, 0, 0, 1,
27, 6, 2, 1, 0, 0, 0, 0, 0, 0, 0, 1,
40, 7, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1,
CROSSREFS
Cf. A027186.
Sequence in context: A114516 A218788 A328969 * A035641 A242434 A036873
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 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)