cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A101049 Number of partitions of n into parts having at most two prime-factors.

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 15, 21, 29, 40, 53, 71, 93, 122, 158, 203, 259, 329, 415, 521, 651, 809, 1001, 1234, 1515, 1853, 2258, 2743, 3321, 4009, 4825, 5791, 6932, 8277, 9859, 11715, 13889, 16431, 19398, 22854, 26873, 31539, 36949, 43210, 50446, 58796, 68419
Offset: 1

Views

Author

Reinhard Zumkeller, Nov 28 2004

Keywords

Examples

			n=10 has two partitions with parts having more than two
prime-factors: 10 = 2*2*2 + 2 = 2*2*2 + 1 + 1, therefore
a(10) = A000041(10) - 2 = 42 - 2 = 40.
		

Crossrefs

Programs