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.

Showing 1-2 of 2 results.

A358638 Number of partitions of n into at most 2 distinct nonprime parts.

Original entry on oeis.org

1, 1, 0, 0, 1, 1, 1, 1, 1, 2, 3, 1, 2, 2, 3, 3, 4, 2, 4, 3, 4, 4, 6, 3, 6, 5, 7, 5, 7, 5, 8, 6, 7, 7, 10, 7, 11, 7, 9, 9, 11, 8, 12, 9, 11, 10, 13, 9, 14, 11, 14, 11, 14, 11, 16, 13, 15, 13, 17, 13, 19, 14, 16, 15, 19, 15, 21, 15, 17, 17, 21, 16, 22, 17, 21, 18, 22, 18, 25, 18, 22
Offset: 0

Views

Author

Ilya Gutkovskiy, Nov 24 2022

Keywords

Crossrefs

Cf. A005171, A018252, A096258, A302479, A347788, A358639, A358640.

Programs

  • PARI
    A358638(n) = if(n<2,1,!isprime(n)+sum(k=1,(n-1)\2,!(isprime(k)+isprime(n-k)))); \\ Antti Karttunen, Nov 25 2022

Formula

For n > 0, a(n) = A005171(n) + A302479(n).

A358639 Number of partitions of n into at most 3 distinct nonprime parts.

Original entry on oeis.org

1, 1, 0, 0, 1, 1, 1, 1, 1, 2, 3, 2, 2, 3, 4, 5, 5, 4, 6, 7, 7, 8, 10, 9, 11, 13, 14, 14, 16, 15, 20, 20, 21, 21, 27, 26, 30, 29, 32, 33, 39, 35, 43, 42, 46, 46, 53, 49, 58, 58, 63, 61, 69, 64, 77, 75, 81, 78, 90, 85, 98, 95, 102, 100, 114, 106, 122, 116, 126, 124, 140
Offset: 0

Views

Author

Ilya Gutkovskiy, Nov 24 2022

Keywords

Crossrefs

Cf. A018252, A096258, A307857, A341461, A347796, A358638, A358640.
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.