Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026903
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026903 a(n) = number of multisets S of positive integers satisfying E(S)=n, where E = 2nd elementary symmetric function; e.g. a(9)=4 counts {1,9},{3,3},{1,1,4},{2,2,2,3}. +0
1
1, 1, 2, 2, 2, 3, 2, 3, 4, 3, 3, 5, 3, 4, 6, 4, 4, 6, 4, 6, 7, 4, 5, 9, 6, 6, 8, 6, 7, 9, 5, 9, 9, 6 (list; graph; listen)
OFFSET

1,3

CROSSREFS

Sequence in context: A078705 A050331 A128435 this_sequence A068324 A143976 A127159

Adjacent sequences: A026900 A026901 A026902 this_sequence A026904 A026905 A026906

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 December 4 12:27 EST 2008. Contains 151280 sequences.


AT&T Labs Research