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.

A341504 Number of ways to write n as an ordered sum of 10 nonprime numbers.

Original entry on oeis.org

1, 0, 0, 10, 0, 10, 45, 10, 100, 130, 135, 460, 390, 820, 1435, 1552, 3135, 4090, 5805, 9370, 12040, 17890, 25485, 33940, 48385, 65812, 87925, 121040, 160155, 212350, 283666, 368590, 482750, 628390, 806450, 1039382, 1327060, 1682860, 2134730, 2684320, 3364819
Offset: 10

Views

Author

Ilya Gutkovskiy, Feb 13 2021

Keywords

Crossrefs

Programs

  • Maple
    b:= proc(n, t) option remember;
          `if`(n=0, `if`(t=0, 1, 0), `if`(t<1, 0, add(
          `if`(isprime(j), 0, b(n-j, t-1)), j=1..n)))
        end:
    a:= n-> b(n, 10):
    seq(a(n), n=10..50);  # Alois P. Heinz, Feb 13 2021
  • Mathematica
    nmax = 50; CoefficientList[Series[Sum[Boole[!PrimeQ[k]] x^k, {k, 1, nmax}]^10, {x, 0, nmax}], x] // Drop[#, 10] &