Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098489
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098489 Triangle T(n,k) read by rows: partitions of n with parts occurring at most thrice, k parts occurring once or twice, and an even number of parts. +0
4
1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 2, 0, 2, 3, 0, 0, 2, 3, 1, 0, 2, 4, 2, 1, 2, 4, 4, 0, 4, 7, 3, 1, 0, 3, 8, 7, 1, 1, 3, 9, 10, 2, 0, 4, 12, 12, 4, 0, 5, 14, 15, 7, 2, 5, 13, 21, 11, 0, 0, 6, 19, 26, 14, 1, 0, 7, 22, 32, 20, 2, 2, 6, 24, 42, 26, 4, 0, 8, 30, 49, 35, 7, 0, 8, 36, 60 (list; graph; listen)
OFFSET

0,14

REFERENCES

A. Fink, R. K. Guy and M. Krusemeyer, Partitions with parts occurring at most thrice, in preparation.

EXAMPLE

{1} {0,0} {0,1} {0,0,1} {0,1,1} {0,1,2} {0,2,3,0}...

6 is 1+1+1+3, 1+1+2+2, 1+5, 2+4, 3+3 with even number of parts and no part more than thrice. Two of these partitions have one part occurring once or twice, and (the middle) three have two such parts. The 6th row is therefore 0,2,3,0.

CROSSREFS

Differs from A098490 in rows with triangular index. Cf. A098493.

Row sums are in A098491.

Sequence in context: A046277 A053571 A129883 this_sequence A128064 A132814 A058623

Adjacent sequences: A098486 A098487 A098488 this_sequence A098490 A098491 A098492

KEYWORD

nonn,tabf

AUTHOR

Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 12 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research