login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096258 Number of partitions of n into distinct nonprime parts. 3
1, 1, 0, 0, 1, 1, 1, 1, 1, 2, 3, 2, 2, 3, 4, 5, 5, 4, 6, 8, 8, 9, 11, 11, 13, 16, 17, 19, 22, 23, 27, 31, 32, 36, 43, 47, 52, 57, 61, 70, 80, 84, 93, 105, 114, 127, 141, 150, 167, 188, 202, 220, 244, 264, 291, 322, 346, 377, 416, 450, 493, 540, 580, 633, 696, 750, 814, 888 (list; graph; refs; listen; history; internal format)
OFFSET

0,10

FORMULA

G.f.: Product_{i>0} (1+x^i)/(1+x^prime(i)).

MATHEMATICA

CoefficientList[ Series[ Product[(1 + x^n)/(1 + x^Prime[n]), {n, 70}], {x, 0, 67}], x] (from Robert G. Wilson v Aug 02 2004)

PROG

(Haskell)

a096258 = p a018252_list where

   p _      0 = 1

   p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m

-- Reinhard Zumkeller, Jan 15 2012

CROSSREFS

Cf. A002095.

Cf. A204389.

Sequence in context: A109337 A137266 A062948 * A049879 A053812 A177865

Adjacent sequences:  A096255 A096256 A096257 * A096259 A096260 A096261

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 31 2004

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 02 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 04:23 EST 2012. Contains 205694 sequences.