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-3 of 3 results.

A300704 Number of compositions (ordered partitions) of n into prime power parts (not including 1) that do not divide n.

Original entry on oeis.org

1, 0, 0, 0, 0, 2, 0, 7, 2, 7, 5, 46, 2, 115, 20, 39, 16, 723, 16, 1819, 27, 559, 414, 11481, 16, 13204, 1763, 6450, 383, 181548, 172, 455646, 1326, 70476, 29809, 571110, 275, 7203906, 121535, 739513, 1703, 45380391, 7362, 113898438, 65049, 757426, 2009203, 717490902, 2304
Offset: 0

Views

Author

Ilya Gutkovskiy, Mar 11 2018

Keywords

Examples

			a(10) = 5 because we have [7, 3], [4, 3, 3], [3, 7], [3, 4, 3] and [3, 3, 4].
		

Crossrefs

Programs

  • Maple
    a:= proc(m) option remember; local b; b:= proc(n) option
          remember; `if`(n=0, 1, add(`if`(nops(ifactors(j)[2])
           <>1 or irem(m, j)=0, 0, b(n-j)), j=2..n)) end; b(m)
        end:
    seq(a(n), n=0..70);  # Alois P. Heinz, Mar 11 2018
  • Mathematica
    Table[SeriesCoefficient[1/(1 - Sum[Boole[Mod[n, k] != 0 && PrimePowerQ[k]] x^k, {k, 1, n}]), {x, 0, n}], {n, 0, 48}]

A300580 Number of partitions of n into prime power parts (not including 1) that do not divide n.

Original entry on oeis.org

1, 0, 0, 0, 0, 1, 0, 3, 1, 3, 2, 11, 1, 18, 6, 9, 5, 43, 5, 65, 7, 31, 30, 137, 5, 115, 59, 84, 26, 379, 19, 519, 42, 213, 197, 323, 23, 1267, 340, 489, 50, 2213, 107, 2897, 221, 375, 938, 4871, 61, 3733, 662, 2193, 553, 10218, 409, 4241, 310, 4341, 3685, 20586, 154, 25792, 5635, 2862, 990, 12806
Offset: 0

Views

Author

Ilya Gutkovskiy, Mar 09 2018

Keywords

Examples

			a(10) = 2 because we have [7, 3] and [4, 3, 3].
		

Crossrefs

Programs

  • Mathematica
    Table[SeriesCoefficient[Product[1/(1 - Boole[Mod[n, k] != 0 && PrimePowerQ[k]] x^k), {k, 1, n}], {x, 0, n}], {n, 0, 65}]

A300586 Number of partitions of n into distinct squarefree parts that do not divide n.

Original entry on oeis.org

1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 2, 1, 4, 2, 2, 4, 6, 2, 8, 4, 6, 6, 15, 4, 11, 10, 12, 8, 30, 3, 38, 24, 17, 24, 23, 14, 70, 36, 37, 23, 102, 8, 122, 49, 39, 80, 177, 38, 136, 54, 113, 101, 297, 60, 152, 102, 192, 226, 485, 28, 571, 312, 200, 390, 338, 84, 908, 393, 507, 104, 1229, 241, 1421
Offset: 0

Views

Author

Ilya Gutkovskiy, Mar 09 2018

Keywords

Examples

			a(14) = 2 because we have [11, 3] and [6, 5, 3].
		

Crossrefs

Programs

  • Mathematica
    Table[SeriesCoefficient[Product[(1 + Boole[Mod[n, k] != 0 && SquareFreeQ[k]] x^k), {k, 1, n}], {x, 0, n}], {n, 0, 73}]
Showing 1-3 of 3 results.