Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050317
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A050317 Number of ways n is a product of partition numbers > 1. +0
1
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 0, 1, 0, 1, 1, 2, 0, 1, 1, 0, 1, 1, 0, 3, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 2, 0, 2, 2, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 2, 0, 0, 0, 3, 0, 0, 1, 1, 0, 2, 0, 0, 0, 1, 0, 1, 0, 0, 2, 0, 2, 0, 0, 1, 1, 0, 0, 2, 0, 0, 0, 2, 0, 3, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0 (list; graph; listen)
OFFSET

2,14

FORMULA

Dirichlet g.f.: prod{n is a partition number > 1}(1/(1-1/n^s)).

CROSSREFS

A000041, A001055, A046064.

Sequence in context: A037889 A098055 A092111 this_sequence A141095 A099313 A097468

Adjacent sequences: A050314 A050315 A050316 this_sequence A050318 A050319 A050320

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Sep 15 1999.

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 September 7 23:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research