The On-Line Encyclopedia of Integer Sequences (OEIS)

A244239 revision #5

A244239

Number of partitions of n into 3 parts such that every i-th smallest part (counted with multiplicity) is different from i.

1, 3, 4, 6, 7, 9, 11, 13, 15, 18, 20, 23, 26, 29, 32, 36, 39, 43, 47, 51, 55, 60, 64, 69, 74, 79, 84, 90, 95, 101, 107, 113, 119, 126, 132, 139, 146, 153, 160, 168, 175, 183, 191, 199, 207, 216, 224, 233, 242, 251, 260, 270, 279, 289, 299, 309, 319, 330, 340

(list; graph; refs; listen; history; text; internal format)

OFFSET

9,2

LINKS

Alois P. Heinz, Table of n, a(n) for n = 9..1000

MAPLE

a:= proc(n) option remember; `if`(n<14, [1, 3, 4, 6, 7][n-8],

((-4*n+56)*a(n-5) +(3*n-16)*a(n-4) +(7*n-66)*a(n-3)

+(4*n-44)*a(n-2) +(28-3*n)*a(n-1)) / (7*n-78))

end:

seq(a(n), n=9..80);

CROSSREFS