A181676 Number of ways of writing n = m + f! with m a semiprime and f > 0.

0, 0, 0, 0, 1, 1, 1, 1, 0, 2, 2, 2, 0, 0, 2, 3, 1, 0, 0, 1, 1, 1, 2, 1, 0, 1, 3, 3, 0, 1, 1, 1, 1, 2, 2, 2, 1, 1, 3, 3, 2, 0, 0, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 0, 1, 1, 3, 2, 3, 1, 1, 1, 3, 2, 0, 1, 1, 1, 0, 2, 2, 0, 1, 0, 3, 1, 0, 1, 2, 1, 1, 1, 2, 1, 0, 2, 2, 3, 2, 0, 1, 2, 3, 1, 2, 2, 2, 1, 1, 1, 2, 0, 0, 0, 0

Offset

1,10

Comments

Number of partitions of n into a semiprime and a factorial.

Links

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

Formula

a(16)=3 because 16 = 2*5 + 3! = 2*7 + 2! = 3*5 + 1!.

Crossrefs

Cf. A000142, A001358, A175940.

Sequence in context: A037864 A285635 A181674 * A262048 A034852 A212438

Adjacent sequences: A181673 A181674 A181675 * A181677 A181678 A181679

Keyword

nonn

Author

Juri-Stepan Gerasimov, Nov 04 2010

Status

approved