Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098490
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098490 Triangle T(n,k) read by rows: partitions of n with parts occurring at most thrice, k parts occurring once or twice and an odd number of parts. +0
4
0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 2, 1, 1, 1, 1, 0, 2, 3, 1, 0, 2, 4, 2, 1, 2, 4, 4, 0, 1, 7, 6, 0, 0, 3, 8, 7, 1, 1, 3, 9, 10, 2, 0, 4, 12, 12, 4, 0, 5, 14, 15, 7, 1, 3, 18, 23, 7, 1, 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, 44 (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,1} {0,1} {1,1,0} {0,1,1} {0,1,2} {1,1,1,1}...

6 is 2+2+2, 6, 1+1+4, 1+2+3, with odd number of parts and no part more than thrice. The number of parts occurring once or twice in these partitions is 0,1,2,3, respectively. The 6th row is therefore 1,1,1,1.

CROSSREFS

Differs from A098489 in rows with triangular index. Cf. A094893.

Row sums are in A098492.

Sequence in context: A137993 A059883 A086967 this_sequence A029419 A165105 A055641

Adjacent sequences: A098487 A098488 A098489 this_sequence A098491 A098492 A098493

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research