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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A181676 Number of ways of writing n = m + f! with m a semiprime and f > 0. 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 (list; graph; refs; listen; history; text; internal format)
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

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

License Agreements, Terms of Use, Privacy Policy .

Last modified February 21 22:56 EST 2018. Contains 299427 sequences. (Running on oeis4.)