login
The OEIS is supported by the many generous donors 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. 21
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; text; internal format)
OFFSET

0,10

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..1000

FORMULA

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

MAPLE

b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,

       b(n, i-1)+ `if`(i>n or isprime(i), 0, b(n-i, i-1))))

    end:

a:= n-> b(n$2):

seq(a(n), n=0..70);  # Alois P. Heinz, May 29 2013

MATHEMATICA

CoefficientList[ Series[ Product[(1 + x^n)/(1 + x^Prime[n]), {n, 70}], {x, 0, 67}], x] (* 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: A303540 A137266 A062948 * A049879 A053812 A177865

Adjacent sequences:  A096255 A096256 A096257 * A096259 A096260 A096261

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic, Jul 31 2004

EXTENSIONS

More terms from Robert G. Wilson v, Aug 02 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 07:55 EST 2022. Contains 350454 sequences. (Running on oeis4.)