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.

A219198 Number of partitions of n into 4 distinct primes.

Original entry on oeis.org

1, 0, 0, 0, 1, 0, 2, 0, 2, 1, 2, 1, 3, 0, 3, 2, 4, 2, 4, 2, 5, 4, 5, 4, 6, 4, 6, 6, 6, 6, 6, 6, 9, 8, 8, 10, 8, 9, 11, 11, 11, 13, 10, 14, 13, 16, 13, 18, 12, 19, 14, 21, 15, 22, 13, 25, 18, 26, 17, 29, 14, 31, 21, 32, 19, 35, 17, 39, 25, 38, 20, 43, 21, 48, 26
Offset: 17

Views

Author

Alois P. Heinz, Nov 14 2012

Keywords

Crossrefs

Column k=4 of A219180.

Programs

  • Maple
    b:= proc(n, i) option remember; `if`(n=0, [1,0$4], `if`(i<1, [0$5],
           zip((x, y)->x+y, b(n, i-1), [0, `if`(ithprime(i)>n, [0$4],
           b(n-ithprime(i), i-1)[1..4])[]], 0)))
        end:
    a:= n-> b(n, numtheory[pi](n))[5]:
    seq(a(n), n=17..100);
  • Mathematica
    k = 4; b[n_, i_] := b[n, i] = If[n == 0, Join[{1}, Array[0&, k]], If[i<1, Array[0&, k+1], Plus @@ PadRight[{b[n, i-1], Join[{0}, If[Prime[i]>n, Array[0&, k], Take[b[n-Prime[i], i-1], k]]]}]]]; a[n_] := b[n, PrimePi[n]][[k+1]]; Table[a[n], {n, 17, 100}] (* Jean-François Alcover, Jan 30 2014, after Alois P. Heinz *)
    Table[Length@Select[IntegerPartitions[k,{4}, Prime@Range@100], #[[1]] > #[[2]] > #[[3]] > #[[4]] &], {k, 17, 100}] (* Robert Price, Apr 25 2025 *)

Formula

G.f.: Sum_{0
a(n) = [x^n*y^4] Product_{i>=1} (1+x^prime(i)*y).