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.

A274842 Number of set partitions of [n] such that the difference between each element and its block index is a multiple of nine.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 21, 42, 81, 152, 279, 502, 885, 1524, 2547, 6629, 15815, 35713, 77769, 165155, 344379, 707693, 1434461, 2859871, 8415994, 23485835, 62727630, 161710529, 404995340, 989816263, 2367377650, 5547588797
Offset: 0

Views

Author

Alois P. Heinz, Jul 08 2016

Keywords

Examples

			a(9) = 1: 1|2|3|4|5|6|7|8|9.
a(10) = 2: 1(10)|2|3|4|5|6|7|8|9, 1|2|3|4|5|6|7|8|9|(10).
a(11) = 3: 1(10)|2(11)|3|4|5|6|7|8|9, 1|2(11)|3|4|5|6|7|8|9|(10), 1|2|3|4|5|6|7|8|9|(10)|(11).
		

Crossrefs

Column k=9 of A274835.

Programs

  • Maple
    b:= proc(n, m, t) option remember; `if`(n=0, 1,
         add(`if`(irem(j-t, 9)=0, b(n-1, max(m, j),
                  irem(t+1, 9)), 0), j=1..m+1))
        end:
    a:= n-> b(n, 0, 1):
    seq(a(n), n=0..45);
  • Mathematica
    b[n_, m_, t_] := b[n, m, t] = If[n == 0, 1, Sum[If[Mod[j - t, 9] == 0, b[n - 1, Max[m, j], Mod[t + 1, 9]], 0], {j, 1, m + 1}]];
    a[n_] := b[n, 0, 1];
    Table[a[n], {n, 0, 45}] (* Jean-François Alcover, May 15 2018, after Alois P. Heinz *)