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.

A298603 Number of partitions of n into odd prime parts (including 1).

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 4, 5, 6, 7, 9, 11, 13, 16, 19, 22, 26, 31, 36, 42, 49, 56, 65, 75, 86, 98, 112, 127, 144, 164, 185, 209, 235, 264, 297, 332, 372, 416, 463, 516, 574, 638, 708, 785, 869, 960, 1061, 1171, 1291, 1421, 1563, 1718, 1886, 2070, 2269, 2484, 2718, 2972, 3247, 3545, 3868, 4216, 4592
Offset: 0

Views

Author

Ilya Gutkovskiy, Jan 22 2018

Keywords

Comments

Partial sums of A099773.

Examples

			a(6) = 4 because we have [5, 1], [3, 3], [3, 1, 1, 1] and [1, 1, 1, 1, 1, 1].
		

Crossrefs

Programs

  • Mathematica
    nmax = 62; CoefficientList[Series[1/(1 - x) Product[1/(1 - x^Prime[k]), {k, 2, nmax}], {x, 0, nmax}], x]

Formula

G.f.: (1/(1 - x))*Product_{k>=2} 1/(1 - x^prime(k)).

A309676 Number of compositions (ordered partitions) of n into odd primes (including 1).

Original entry on oeis.org

1, 1, 1, 2, 3, 5, 8, 13, 21, 33, 53, 86, 138, 222, 357, 573, 921, 1481, 2381, 3828, 6153, 9890, 15898, 25556, 41082, 66039, 106156, 170644, 274307, 440945, 708815, 1139412, 1831589, 2944253, 4732847, 7607989, 12229743, 19659153, 31601828, 50799517, 81659549
Offset: 0

Views

Author

Ilya Gutkovskiy, Aug 12 2019

Keywords

Crossrefs

Programs

  • Maple
    a:= proc(n) option remember; `if`(n=0, 1, a(n-1)+
          add(`if`(isprime(j), a(n-j), 0), j=3..n))
        end:
    seq(a(n), n=0..42);  # Alois P. Heinz, Aug 12 2019
  • Mathematica
    nmax = 42; CoefficientList[Series[1/(1 - x - Sum[x^Prime[k], {k, 2, nmax}]), {x, 0, nmax}], x]
    a[0] = 1; a[n_] := a[n] = Sum[Boole[PrimeOmega[k] < 2 && OddQ[k]] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 42}]

Formula

G.f.: 1/(1 - x - Sum_{k>=2} x^prime(k)).
Showing 1-2 of 2 results.