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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091114 Number of partitions of n-th composite number containing the smallest prime factor: a(n) = A027293(A002808(n), A056608(n)). 2
2, 5, 11, 11, 22, 42, 77, 77, 135, 231, 385, 385, 627, 1002, 627, 1575, 1575, 2436, 3718, 5604, 5604, 8349, 5604, 12310, 17977, 17977, 26015, 37338, 53174, 53174, 75175, 105558, 53174, 147273, 147273, 204226, 281589, 204226, 386155, 386155 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(n) = A000041(A002808(n)) - A091094(n).

a(n) = A000041(A085271(n)). - Charlie Neder, Jan 10 2019

LINKS

Table of n, a(n) for n=1..40.

EXAMPLE

n=2: A002808(2)=6=2*3 has A000041(6)=11 partitions: 6 = 5+1 = 4+2 = 4+1+1 = 3+3 = 3+2+1 = 3+1+1+1 = 2+2+2 = 2+2+1+1 = 2+1+1+1+1 = 1+1+1+1+1+1, 2 occurs in 5 partitions, therefore a(2)=5.

PROG

(PARI) lista(nn) = forcomposite(n=2, nn, print1(numbpart(n - divisors(n)[2]), ", ")); \\ Michel Marcus, Jan 11 2019

CROSSREFS

Cf. A002808, A000041, A020639, A027293, A056608, A085271, A091109, A091094.

Sequence in context: A079008 A144573 A062251 * A155767 A079782 A093554

Adjacent sequences:  A091111 A091112 A091113 * A091115 A091116 A091117

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Feb 22 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 April 18 22:08 EDT 2019. Contains 322237 sequences. (Running on oeis4.)