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!)
A098492 Number of partitions of n with parts occurring at most thrice and an odd number of parts. Row sums of A098490. 3
0, 1, 1, 2, 2, 3, 4, 6, 8, 11, 14, 19, 25, 32, 41, 53, 66, 83, 104, 129, 160, 198, 242, 296, 361, 438, 530, 640, 769, 923, 1105, 1318, 1569, 1864, 2208, 2611, 3081, 3628, 4264, 5003, 5858, 6848, 7993, 9312, 10833, 12585, 14595, 16904, 19552, 22582, 26049 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
Alex Fink, Richard K. Guy, and Mark Krusemeyer, Partitions with parts occurring at most thrice, Contributions to Discrete Mathematics, Vol 3, No 2 (2008), pp. 76-114.
FORMULA
a(n) = (A001935(n)-(-1)^n*A010054(n))/2. - Vladeta Jovovic, Sep 16 2004
CROSSREFS
Equals A001935 - A098491. Differs from A098491 at triangular indices.
Sequence in context: A141847 A182372 A089333 * A217314 A173508 A103632
KEYWORD
nonn
AUTHOR
Ralf Stephan, Sep 12 2004
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 18 08:14 EDT 2024. Contains 371769 sequences. (Running on oeis4.)