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!)
A194711 Triangle read by rows: T(n,k) = number of partitions or zones in the last section of the set of partitions of n that contains k as a part. 1
1, 1, 1, 2, 0, 1, 3, 1, 0, 1, 5, 1, 1, 0, 1, 7, 2, 1, 1, 0, 1, 11, 2, 2, 1, 1, 0, 1, 15, 4, 2, 1, 1, 1, 0, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
It appears that row n lists A000041(n)-1 together with the row n-2 of the triangle A116598, if n >= 2.
LINKS
EXAMPLE
Triangle begins:
1,
1, 1,
2, 0, 1,
3, 1, 0, 1,
5, 1, 1, 0, 1,
7, 2, 1, 1, 0, 1,
11, 2, 2, 1, 1, 0, 1,
15, 4, 2, 1, 1, 1, 0, 1,
CROSSREFS
Column 1 is A000041. Columns >= 2 are A002865.
Sequence in context: A168019 A026794 A137712 * A168532 A181940 A356154
KEYWORD
nonn,tabl,more
AUTHOR
Omar E. Pol, Feb 10 2012
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 April 25 12:15 EDT 2024. Contains 371969 sequences. (Running on oeis4.)